2836 search results - page 340 / 568 » Parsing Algorithms and Metrics |
201
click to vote
BNCOD
2004
15 years 9 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
177
click to vote
SODA
2004
ACM
15 years 9 months ago
2004
ACM
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
176
click to vote
GD
2008
Springer
15 years 8 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
186
click to vote
ADHOC
2007
15 years 7 months ago
2007
Energy efficient and power aware protocols are of utmost importance in Sensor Networks. The most popular criteria, so far, for evaluating performance of energy-aware protocols are...
152
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
This paper presents the generalization of weighted distances to modules and their computation through the chamfer algorithm on general point lattices. The first part is dedicated ...