7930 search results - page 534 / 1586 » Greedy in Approximation Algorithms |
165
click to vote
ESA
1994
Springer
15 years 11 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
173
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. ...
155
click to vote
DMIN
2007
15 years 8 months ago
2007
Abstract — New privacy regulations together with everincreasing data availability and computational power have created a huge interest in data privacy research. One major researc...
197
click to vote
ISCAPDCS
2004
15 years 8 months ago
2004
Internet today, has transformed into a global information hub. The increase in its usage and magnitude have sparkled various research problems. Because of the diverse user populat...
206
click to vote
NIPS
2001
15 years 8 months ago
2001
This paper presents an unsupervised learning algorithm that can derive the probabilistic dependence structure of parts of an object (a moving human body in our examples) automatic...