Sciweavers

2836 search results - page 183 / 568
» Parsing Algorithms and Metrics
Sort
View
ICALP
2004
Springer
14 years 1 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
ATAL
2009
Springer
14 years 24 days ago
On fast exploration in 2D and 3D terrains with multiple robots
We present a fast multi-robotic exploration methodology for 2D and 3D terrains. An asynchronous exploration strategy is introduced which shows significant improvements over the ex...
Rahul Sawhney, K. Madhava Krishna, Kannan Srinatha...
HIPEAC
2010
Springer
14 years 5 months ago
Performance and Power Aware CMP Thread Allocation Modeling
We address the problem of performance and power-efficient thread allocation in a CMP. To that end, based on analytical model, we introduce a parameterized performance/power metric ...
Yaniv Ben-Itzhak, Israel Cidon, Avinoam Kolodny
IJHPCN
2008
94views more  IJHPCN 2008»
13 years 8 months ago
Analysing and improving clustering based sampling for microprocessor simulation
: We propose a set of statistical metrics for making a comprehensive, fair, and insightful evaluation of features, clustering algorithms, and distance measures in representative sa...
Yue Luo, Ajay Joshi, Aashish Phansalkar, Lizy Kuri...
COMGEO
1999
ACM
13 years 7 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland