Sciweavers

10715 search results - page 14 / 2143
» Proofs from Tests
Sort
View
218
Voted
ECOOP
2009
Springer
16 years 4 months ago
From Public to Private to Absent: Refactoring Java Programs under Constrained Accessibility
Contemporary refactoring tools for JAVA aiding in the restructuring of programs have problems with respecting access modifiers such as public and private: while some tools provide ...
Friedrich Steimann, Andreas Thies
130
Voted
CIKM
1997
Springer
15 years 7 months ago
Learning Belief Networks from Data: An Information Theory Based Approach
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
Jie Cheng, David A. Bell, Weiru Liu
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
15 years 10 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan
108
Voted
TABLEAUX
1998
Springer
15 years 7 months ago
Deleting Redundancy in Proof Reconstruction
We present a framework for eliminating redundancies during the reconstruction of sequent proofs from matrix proofs. We show that search-free proof reconstruction requires knowledge...
Stephan Schmitt, Christoph Kreitz
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
16 years 3 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira