Sciweavers

307 search results - page 11 / 62
» A Comparison of Algorithms for Connected Set Openings and Cl...
Sort
View
CVPR
2010
IEEE
14 years 16 days ago
Exploiting Global Connectivity Constraints for Reconstruction of 3D Line Segments from Images
Given a set of 2D images, we propose a novel approach for the reconstruction of straight 3D line segments that represent the underlying geometry of static 3D objects in the scene....
Arjun Jain, Christian Kurz, Thorsten Thormaehlen, ...
MICCAI
2006
Springer
14 years 8 months ago
Open-Curve Shape Correspondence Without Endpoint Correspondence
Abstract. Shape correspondence is the foundation for accurate statistical shape analysis; this is usually accomplished by identifying a set of sparsely sampled and well-corresponde...
Theodor Richardson, Song Wang
ICALP
2005
Springer
14 years 28 days ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
ICRA
1994
IEEE
127views Robotics» more  ICRA 1994»
13 years 11 months ago
"RISC" for Industrial Robotics: Recent Results and Open Problems
At the intersection of robotics, computational geometry, and manufacturingengineering, we have identifieda collection of research problems with near-term industrial applications. ...
John F. Canny, Kenneth Y. Goldberg
SIGMOD
2002
ACM
132views Database» more  SIGMOD 2002»
14 years 7 months ago
Clustering by pattern similarity in large data sets
Clustering is the process of grouping a set of objects into classes of similar objects. Although definitions of similarity vary from one clustering model to another, in most of th...
Haixun Wang, Wei Wang 0010, Jiong Yang, Philip S. ...