99 search results - page 4 / 20 » Distance Approximation in Bounded-Degree and General Sparse ... |
121
click to vote
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
136
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
132
Voted
SIAMCOMP
2000
15 years 1 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
117
click to vote
PAMI
2011
14 years 9 months ago
2011
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
132
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...