2877 search results - page 88 / 576 » The Complexity of Planarity Testing |
112
click to vote
CRV
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we make use of the idea that a robot can autonomously discover objects and learn their appearances by poking and prodding at interesting parts of a scene. In order t...
126
Voted
IJRR
2000
15 years 3 months ago
2000
In this paper we present the results of experiments that explore the ability of the human fingertip to detect haptically simulated first-order and second-order surface discontinui...
138
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
136
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
146
click to vote
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...