7930 search results - page 397 / 1586 » Greedy in Approximation Algorithms |
239
click to vote
ICDT
2011
ACM
14 years 10 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...
261
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
171
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
223
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We introduce a Bayesian model, BayesANIL, that is capable of estimating uncertainties associated with the labeling process. Given a labeled or partially labeled training corpus of...
271
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...