7006 search results - page 216 / 1402 » Approximation Algorithms |
151
click to vote
SODA
1993
ACM
15 years 4 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
124
Voted
AAECC
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...
116
Voted
ICPR
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract—This paper presents an approximate belief propagation algorithm that replaces outgoing messages from a node with the averaged outgoing message and propagates messages fr...
136
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
171
Voted
ICDT
2011
ACM
14 years 6 months ago
2011
ACM
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...