2342 search results - page 321 / 469 » Sublinear geometric algorithms |
137
click to vote
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
145
Voted
TALG
2010
14 years 10 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
137
click to vote
MOR
2010
15 years 1 months ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
127
click to vote
CVPR
2003
IEEE
16 years 5 months ago
2003
IEEE
We introduce two appearance-based methods for clustering a set of images of 3-D objects, acquired under varying illumination conditions, into disjoint subsets corresponding to ind...
129
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...