Sciweavers

5153 search results - page 780 / 1031
» Introduction to Randomized Algorithms
Sort
View
134
Voted
SPAA
2005
ACM
15 years 9 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
100
Voted
CIKM
2005
Springer
15 years 9 months ago
Joint deduplication of multiple record types in relational data
Record deduplication is the task of merging database records that refer to the same underlying entity. In relational databases, accurate deduplication for records of one type is o...
Aron Culotta, Andrew McCallum
156
Voted
DAGM
2005
Springer
15 years 9 months ago
Cluster-Based Point Cloud Analysis for Rapid Scene Interpretation
A histogram-based method for the interpretation of three-dimensional (3D) point clouds is introduced, where point clouds represent the surface of a scene of multiple objects and ba...
Eric Wahl, Gerd Hirzinger
141
Voted
GECCO
2005
Springer
120views Optimization» more  GECCO 2005»
15 years 9 months ago
Exploiting gradient information in numerical multi--objective evolutionary optimization
Various multi–objective evolutionary algorithms (MOEAs) have obtained promising results on various numerical multi– objective optimization problems. The combination with gradi...
Peter A. N. Bosman, Edwin D. de Jong
143
Voted
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
15 years 9 months ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon