Sciweavers

2095 search results - page 107 / 419
» Improved pebbling bounds
Sort
View
106
Voted
ICIP
2006
IEEE
16 years 2 months ago
Improved Unsymmetric-Cross Multi-Hexagon-Grid Search Algorithm for Fast Block Motion Estimation
We develop a set of new motion estimation (ME) algorithms based mainly on Unsymmetric-Cross Multi-Hexagon-Grid Search (UMH). The original algorithms are improved by applying the S...
Janne Heikkilä, Tuukka Toivonen
VLDB
2007
ACM
137views Database» more  VLDB 2007»
16 years 1 months ago
Improving Data Quality: Consistency and Accuracy
Two central criteria for data quality are consistency and accuracy. Inconsistencies and errors in a database often emerge as violations of integrity constraints. Given a dirty dat...
Gao Cong, Wenfei Fan, Floris Geerts, Xibei Jia, Sh...
81
Voted
ACSC
2006
IEEE
15 years 6 months ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
94
Voted
CVRMED
1997
Springer
15 years 5 months ago
Geometric constraint analysis and synthesis: methods for improving shape-based registration accuracy
Shape-based registration is a process for estimating the transformation between two shape representations of an object. It is used in many image-guided surgical systems to establis...
David A. Simon, Takeo Kanade
213
Voted
GIS
2005
ACM
16 years 1 months ago
Improving the R*-tree with outlier handling techniques
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
Tian Xia, Donghui Zhang