Sciweavers

450 search results - page 30 / 90
» Estimating Search Tree Size
Sort
View
CP
1998
Springer
14 years 1 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
CVPR
2007
IEEE
14 years 11 months ago
City-Scale Location Recognition
We look at the problem of location recognition in a large image dataset using a vocabulary tree. This entails finding the location of a query image in a large dataset containing 3...
Grant Schindler, Matthew Brown, Richard Szeliski
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 1 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
TCSV
2008
99views more  TCSV 2008»
13 years 8 months ago
Efficient Reference Frame Selector for H.264
This paper proposes a simple yet effective mechanism to select proper reference frames for H.264 motion estimation. Unlike traditional video codecs, H.264 permits more than one ref...
Tien-Ying Kuo, Hsin-Ju Lu
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
13 years 8 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye