Sciweavers

TOCL
2010
103views more  TOCL 2010»
12 years 11 months ago
Monadic datalog over finite structures of bounded treewidth
Georg Gottlob, Reinhard Pichler, Fang Wei
TOCL
2010
109views more  TOCL 2010»
12 years 11 months ago
An inclusion theorem for defeasible logics
David Billington, Grigoris Antoniou, Guido Governa...
TOCL
2010
100views more  TOCL 2010»
12 years 11 months ago
A theory of sampling for continuous-time metric temporal logic
Carlo A. Furia, Matteo Rossi
TOCHI
2010
105views more  TOCHI 2010»
12 years 11 months ago
Parallel prototyping leads to better design results, more divergence, and increased self-efficacy
Steven P. Dow, Alana Glassco, Jonathan Kass, Melis...
TOCHI
2010
93views more  TOCHI 2010»
12 years 11 months ago
SAK: Scanning ambiguous keyboard for efficient one-key text entry
I. Scott MacKenzie, Torsten Felzer
TOC
2010
142views Management» more  TOC 2010»
12 years 11 months ago
Decision Trees and Influence: an Inductive Proof of the OSSS Inequality
: We give a simple proof of the OSSS inequality (O'Donnell, Saks, Schramm, Servedio, FOCS 2005). The inequality states that for any decision tree T calculating a Boolean funct...
Homin K. Lee
TOC
2010
147views Management» more  TOC 2010»
12 years 11 months ago
Quantum Expanders: Motivation and Construction
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma
TOC
2010
127views Management» more  TOC 2010»
12 years 11 months ago
The Submodular Welfare Problem with Demand Queries
: We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...
Uriel Feige, Jan Vondrák
TOC
2010
155views Management» more  TOC 2010»
12 years 11 months ago
A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
Andris Ambainis