2836 search results - page 317 / 568 » Parsing Algorithms and Metrics |
179
Voted
TVCG
2011
14 years 11 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
163
click to vote
KDD
2012
ACM
13 years 7 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
144
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
128
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
161
click to vote
SENSYS
2006
ACM
15 years 10 months ago
2006
ACM
Introducing mobile data sinks into wireless sensor networks (WSNs) improves the energy efficiency and the network lifetime, and is demanded for many application scenarios, such a...