2843 search results - page 444 / 569 » Interpolation by geometric algorithm |
116
click to vote
MOBIHOC
2002
ACM
15 years 10 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...
118
click to vote
MST
2010
14 years 5 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
Recognizing object classes and their 3D viewpoints is an
important problem in computer vision. Based on a partbased
probabilistic representation [31], we propose a new
3D object...
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
We propose a geometric approach to 3-D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the ...
91
Voted
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
We present a new method for generating large numbers of accurate point correspondences between two wide baseline images. This is important for structure-from-motion algorithms, wh...