6365 search results - page 1024 / 1273 » Fast Local Computation Algorithms |
167
click to vote
EMMCVPR
2009
Springer
15 years 4 months ago
2009
Springer
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...
202
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
171
Voted
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
201
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
193
click to vote
ACCV
2006
Springer
16 years 21 days ago
2006
Springer
Background subtraction is an essential task in several static camera based computer vision systems. Background modeling is often challenged by spatio-temporal changes occurring due...