1941 search results - page 312 / 389 » On the Hardness of Approximate Reasoning |
137
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
168
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
177
click to vote
SIGMETRICS
2010
ACM
15 years 11 months ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
149
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
165
click to vote
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...