Sciweavers

3368 search results - page 276 / 674
» The Complexity of Query Reliability
Sort
View
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
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...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
175
Voted
IR
2007
15 years 6 months ago
Restricted inflectional form generation in management of morphological keyword variation
Word form normalization through lemmatization or stemming is a standard procedure in information retrieval because morphological variation needs to be accounted for and several la...
Kimmo Kettunen, Eija Airio, Kalervo Järvelin
EDBT
2008
ACM
144views Database» more  EDBT 2008»
16 years 6 months ago
BI batch manager: a system for managing batch workloads on enterprise data-warehouses
Modern enterprise data warehouses have complex workloads that are notoriously difficult to manage. An important problem in workload management is to run these complex workloads `o...
Abhay Mehta, Chetan Gupta, Umeshwar Dayal
CCS
2004
ACM
16 years 1 days ago
Private inference control
Access control can be used to ensure that database queries pertaining to sensitive information are not answered. This is not enough to prevent users from learning sensitive inform...
David P. Woodruff, Jessica Staddon
ECCC
2006
120views more  ECCC 2006»
15 years 6 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin