Sciweavers

591 search results - page 37 / 119
» Computing fundamental groups from point clouds
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 2 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
ICMCS
2005
IEEE
134views Multimedia» more  ICMCS 2005»
15 years 4 months ago
Relevance Feedback Methods in Content Based Retrieval and Video Summarization
In the current state-of-the-art in multimedia content analysis (MCA), the fundamental techniques are typically derived from core pattern recognition and computer vision algorithms...
Micha Haas, Ard Oerlemans, Michael S. Lew
103
Voted
CVPR
2012
IEEE
13 years 1 months ago
Real-time image-based 6-DOF localization in large-scale environments
We present a real-time approach for image-based localization within large scenes that have been reconstructed offline using structure from motion (Sfm). From monocular video, our...
Hyon Lim, Sudipta N. Sinha, Michael F. Cohen, Matt...
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
14 years 10 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
ETVC
2008
15 years 22 days ago
Abstracts of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing
s of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing Frank Nielsen Ecole Polytechnique, Palaiseau, France Sony CSL, Tokyo, Japan Abstract. We list the abstracts o...
Frank Nielsen