Sciweavers

50 search results - page 9 / 10
» Computationally Scalable Partial Distance Based Fast Search ...
Sort
View
IMC
2003
ACM
13 years 11 months ago
Virtual landmarks for the internet
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
Liying Tang, Mark Crovella
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
13 years 11 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
14 years 17 days ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
ECCV
2002
Springer
14 years 8 months ago
Visual Data Fusion for Objects Localization by Active Vision
Visual sensors provide exclusively uncertain and partial knowledge of a scene. In this article, we present a suitable scene knowledge representation that makes integration and fusi...
François Chaumette, Grégory Flandin
ICCV
2007
IEEE
14 years 24 days ago
Fast Automatic Heart Chamber Segmentation from 3D CT Data Using Marginal Space Learning and Steerable Features
Multi-chamber heart segmentation is a prerequisite for global quantification of the cardiac function. The complexity of cardiac anatomy, poor contrast, noise or motion artifacts ...
Yefeng Zheng, Adrian Barbu, Bogdan Georgescu, Mich...