1664 search results - page 187 / 333 » Distance labeling in graphs |
156
click to vote
ICRA
1999
IEEE
15 years 10 months ago
1999
IEEE
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
195
click to vote
IJCV
2006
15 years 6 months ago
2006
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
162
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
189
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
152
click to vote
ICB
2009
Springer
16 years 1 months ago
2009
Springer
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...