Sciweavers

450 search results - page 19 / 90
» Estimating Search Tree Size
Sort
View
3DIM
2007
IEEE
14 years 3 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
ICIP
2010
IEEE
13 years 6 months ago
Fast bilateral filtering by adapting block size
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
Wei Yu, Franz Franchetti, James C. Hoe, Yao-Jen Ch...
APWEB
2006
Springer
14 years 19 days ago
Sample Sizes for Query Probing in Uncooperative Distributed Information Retrieval
The goal of distributed information retrieval is to support effective searching over multiple document collections. For efficiency, queries should be routed to only those collectio...
Milad Shokouhi, Falk Scholer, Justin Zobel
SIGIR
2008
ACM
13 years 8 months ago
Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces
Efficient similarity search in high-dimensional spaces is important to content-based retrieval systems. Recent studies have shown that sketches can effectively approximate L1 dist...
Wei Dong, Moses Charikar, Kai Li
IAJIT
2010
150views more  IAJIT 2010»
13 years 7 months ago
Optimal DSP Based Integer Motion Estimation Implementation for H.264/AVC Baseline Encoder
: The coding gain of the H.264/AVC video encoder mainly comes from the new incorporated prediction tools. However, their enormous computation and ultrahigh memory bandwidth are the...
Imen Werda, Haithem Chaouch, Amine Samet, Mohamed ...