Sciweavers

1763 search results - page 224 / 353
» Dependent random choice
Sort
View
AAAI
2007
13 years 10 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
ICPR
2010
IEEE
13 years 10 months ago
Evaluation of a New Point Clouds Registration Method Based on Group Averaging Features
Registration of point clouds is required in the processing of large biological data sets. The tradeoff between computation time and accuracy of the registration is the main challen...
Maja Temerinac-Ott, Margret Keuper, Hans Burkhardt
CCCG
2008
13 years 9 months ago
Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
Jonathan Derryberry, Don Sheehy, Maverick Woo, Dan...
COLING
2008
13 years 9 months ago
Classifying What-Type Questions by Head Noun Tagging
Classifying what-type questions into proper semantic categories is found more challenging than classifying other types in question answering systems. In this paper, we propose to ...
Fangtao Li, Xian Zhang, Jinhui Yuan, Xiaoyan Zhu
GEM
2007
13 years 9 months ago
Initial Population for Genetic Algorithms: A Metric Approach
- Besides the difficulty of the application problem to be solved with Genetic Algorithms (GAs), an additional difficulty arises because the quality of the solution found, or the ...
Pedro A. Diaz-Gomez, Dean F. Hougen