Sciweavers

89 search results - page 9 / 18
» Fast Algorithm for Nearest Neighbor Search Based on a Lower ...
Sort
View
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
13 years 11 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
ICIP
2004
IEEE
14 years 9 months ago
Fast full search block motion estimation for H.264/AVC with multilevel successive elimination algorithm
We modify the multilevel successive elimination algorithm (MSEA) to make it compatible with the motion estimation required for the H.264/AVC video coding standard. The algorithm m...
Janne Heikkilä, Tuukka Toivonen
COCOA
2010
Springer
13 years 5 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
3DIM
2003
IEEE
13 years 11 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 7 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono