Sciweavers

131 search results - page 20 / 27
» Complexity of the Satisfiability Problem for a Class of Prop...
Sort
View
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
13 years 10 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
ECCC
2007
69views more  ECCC 2007»
13 years 8 months ago
Testing Symmetric Properties of Distributions
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
Paul Valiant
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 8 months ago
Mining all frequent projection-selection queries from a relational table
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos
ICML
2005
IEEE
14 years 9 months ago
Weighted decomposition kernels
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
Sauro Menchetti, Fabrizio Costa, Paolo Frasconi
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
14 years 27 days ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung