Sciweavers

4966 search results - page 801 / 994
» its 2010
Sort
View
EAAI
2007
93views more  EAAI 2007»
15 years 6 months ago
Mining Pareto-optimal rules with respect to support and confirmation or support and anti-support
: In knowledge discovery and data mining many measures of interestingness have been proposed in order to measure the relevance and utility of the discovered patterns. Among these m...
Izabela Brzezinska, Salvatore Greco, Roman Slowins...
ECCC
2007
86views more  ECCC 2007»
15 years 6 months ago
Interactive PCP
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
Yael Tauman Kalai, Ran Raz
ECCC
2007
124views more  ECCC 2007»
15 years 6 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
Artur Czumaj, Asaf Shapira, Christian Sohler
216
Voted
ECCC
2007
127views more  ECCC 2007»
15 years 6 months ago
Universal Semantic Communication I
Is it possible for two intelligent beings to communicate meaningfully, without any common language or background? This question has interest on its own, but is especially relevant...
Brendan Juba, Madhu Sudan
ECCC
2007
122views more  ECCC 2007»
15 years 6 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam