6274 search results - page 177 / 1255 » From query complexity to computational complexity |
145
click to vote
SIGECOM
2008
ACM
15 years 4 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
182
click to vote
PVLDB
2008
15 years 3 months ago
2008
The diversity and large volumes of data processed in the Natural Sciences today has led to a proliferation of highlyspecialized and autonomous scientific databases with inherent a...
124
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
120
click to vote
AIIA
2007
Springer
15 years 10 months ago
2007
Springer
Relational database (DB) management systems provide the standard means for structuring and querying large amounts of data. However, to access such data the exact structure of the D...
135
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
This paper reports our first set of results on managing uncertainty in data integration. We posit that data-integration systems need to handle uncertainty at three levels, and do...