Sciweavers

2570 search results - page 187 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
135
Voted
CVPR
2004
IEEE
16 years 5 months ago
Perspective Shape-from-Shading by Fast Marching
Shape-from-Shading (SfS) is a fundamental problem in Computer Vision. At its basis lies the image irradiance equation. Recently, the authors proposed to base the image irradiance ...
Ariel Tankus, Nir A. Sochen, Yehezkel Yeshurun
138
Voted
SIGMOD
1999
ACM
181views Database» more  SIGMOD 1999»
15 years 7 months ago
Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
Jeffrey Scott Vitter, Min Wang
CVPR
2009
IEEE
16 years 10 months ago
From Structure-from-Motion Point Clouds to Fast Location Recognition
Efficient view registration with respect to a given 3D reconstruction has many applications like inside-out tracking in indoor and outdoor environments, and geo-locating images ...
Arnold Irschara (Graz University of Technology), C...
102
Voted
ICCAD
2006
IEEE
131views Hardware» more  ICCAD 2006»
16 years 14 days ago
Fast wire length estimation by net bundling for block placement
The wire length estimation is the bottleneck of packing based block placers. To cope with this problem, we present a fast wire length estimation method in this paper. The key idea...
Tan Yan, Hiroshi Murata
ICRA
2009
IEEE
259views Robotics» more  ICRA 2009»
15 years 10 months ago
Fast Point Feature Histograms (FPFH) for 3D registration
— In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point clo...
Radu Bogdan Rusu, Nico Blodow, Michael Beetz