Sciweavers

COMBINATORICA
2008
92views more  COMBINATORICA 2008»
13 years 3 months ago
A separation theorem in property testing
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
Noga Alon, Asaf Shapira
NIPS
2003
13 years 4 months ago
Approximability of Probability Distributions
We consider the question of how well a given distribution can be approximated with probabilistic graphical models. We introduce a new parameter, effective treewidth, that captures...
Alina Beygelzimer, Irina Rish
STACS
2001
Springer
13 years 7 months ago
Evasiveness of Subgraph Containment and Related Properties
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
Amit Chakrabarti, Subhash Khot, Yaoyun Shi
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 3 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira