3341 search results - page 501 / 669 » On Bounded Queries and Approximation |
167
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
190
click to vote
AAAI
2007
15 years 8 months ago
2007
In auction theory, agents are typically presumed to have perfect knowledge of their valuations. In practice, though, they may face barriers to this knowledge due to transaction co...
156
click to vote
DEXA
2010
Springer
15 years 7 months ago
2010
Springer
Significant research efforts have recently been dedicated to modeling and querying uncertain data. In this paper, we focus on skyline analysis of uncertain data, modeled as uncert...
163
click to vote
CSL
2010
Springer
15 years 6 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
199
click to vote
COMGEO
2000
ACM
15 years 6 months ago
2000
ACM
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...