Search
Now showing items 61-70 of 957
Discovering Latent Classes in Relational Data
(2004-07-22)
We present a framework for learning abstract relational knowledge with the aimof explaining how people acquire intuitive theories of physical, biological, orsocial systems. Our approach is based on a generative relational ...
A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees
(2004-07-05)
We present a constant-factor approximation algorithm for computing anembedding of the shortest path metric of an unweighted graph into atree, that minimizes the multiplicative distortion.
Dynamically Resizable Static CMOS Logic for Fine-Grain Leakage
(2004-07-12)
Digital circuits often have a critical path that runs through a smallsubset of the component subblocks, but where the path changes dynamicallyduring operation. Dynamically resizable static CMOS (DRCMOS) logic isproposed ...
Optimal Approximations of the Frequency Moments
(2004-07-02)
We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data stream for any real k>2. Together with known lower bounds, this resolves the main problem left open by Alon, Matias, ...
Combining Object and Feature Dynamics in Probabilistic Tracking
(2005-03-02)
Objects can exhibit different dynamics at different scales, a property that isoftenexploited by visual tracking algorithms. A local dynamicmodel is typically used to extract image features that are then used as inputsto a ...
Receptive field structures for recognition
(2005-03-01)
Localized operators, like Gabor wavelets and difference-of-Gaussian filters, are considered to be useful tools for image representation. This is due to their ability to form a  sparse code that can serve as a basis set ...
An Expectation Maximization Approach for Integrated Registration, Segmentation, and Intensity Correction
(2005-04-01)
This paper presents a statistical framework which combines the registration of an atlas with the segmentation of MR images. We use an Expectation Maximization-based algorithm to find a solution within the model, which ...
Combining Variable Selection with Dimensionality Reduction
(2005-03-30)
This paper bridges the gap between variable selection methods (e.g., Pearson coefficients, KS test) and dimensionality reductionalgorithms (e.g., PCA, LDA). Variable selection algorithms encounter difficulties dealing with ...
Matrix Approximation and Projective Clustering via Iterative Sampling
(2005-03-29)
We present two new results for the problem of approximating a given real m by n matrix A by a rank-k matrix D, where k < min{m, n}, so as to minimize ||A-D||_F^2. It is known that bysampling O(k/eps) rows of the matrix, ...
Motion Coordination Using Virtual Nodes
(2005-04-06)
We describe how a virtual node abstraction layer can be used to coordinate the motion of real mobile nodes in a region of 2-space. In particular, we consider how nodes in a mobile ad hoc network can arrange themselves along ...