7015 search results - page 416 / 1403 » Approximation algorithms for co-clustering |
207
click to vote
TSP
2008
15 years 6 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
228
click to vote
JUCS
2007
15 years 6 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
158
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Existing Full-wave Model Order Reduction (FMOR) approaches are based on Expanded Taylor Series Approximations (ETAS) of the oscillatory full-wave system matrix. The accuracy of su...
216
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
194
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We deal with consensus-based online estimation and tracking of (non-) stationary signals using ad hoc wireless sensor networks (WSNs). A distributed (D-) least-mean square (LMS) l...