Sciweavers

5995 search results - page 1168 / 1199
» Algorithmic Game Theory
Sort
View
PODS
2010
ACM
242views Database» more  PODS 2010»
15 years 2 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
PODS
2010
ACM
181views Database» more  PODS 2010»
15 years 2 months ago
Schema design for XML repositories: complexity and tractability
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...
Wim Martens, Matthias Niewerth, Thomas Schwentick
SIGECOM
2010
ACM
156views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
Robust mechanisms for risk-averse sellers
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
Mukund Sundararajan, Qiqi Yan
77
Voted
CSR
2010
Springer
15 years 2 months ago
Balancing Bounded Treewidth Circuits
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Maurice Jansen, Jayalal M. N. Sarma
ICALP
2010
Springer
15 years 2 months ago
Testing Non-uniform k-Wise Independent Distributions over Product Spaces
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
Ronitt Rubinfeld, Ning Xie
« Prev « First page 1168 / 1199 Last » Next »