9888 search results - page 1781 / 1978 » Active Algorithm Selection |
91
Voted
VISUALIZATION
1997
IEEE
15 years 3 months ago
1997
IEEE
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
81
Voted
SI3D
1997
ACM
15 years 3 months ago
1997
ACM
A pair of rendered images and their Z-buffers contain almost all of the information necessary to re-render from nearby viewpoints. For the small changes in viewpoint that occur in...
104
click to vote
DAS
2010
Springer
15 years 2 months ago
2010
Springer
Conventional optical character recognition (OCR) systems operate on individual characters and words, and do not normally exploit document or collection context. We describe a Coll...
98
Voted
COCO
2004
Springer
15 years 2 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...