Sciweavers

4940 search results - page 216 / 988
» On the Complexity of Universal Programs
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
CAV
2000
Springer
138views Hardware» more  CAV 2000»
15 years 10 months ago
Counterexample-Guided Abstraction Refinement
xample-Guided Abstraction Refinement for Symbolic Model Checking EDMUND CLARKE YUAN LU Carnegie Mellon University, Pittsburgh, Pennsylvania Broadcom Co., San Jose, California ORNA ...
Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan ...
PODS
2010
ACM
223views Database» more  PODS 2010»
15 years 8 months ago
Characterizing schema mappings via data examples
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange...
Bogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan
FOSSACS
2003
Springer
15 years 11 months ago
A Game Semantics for Generic Polymorphism
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
Samson Abramsky, Radha Jagadeesan
KDD
1997
ACM
184views Data Mining» more  KDD 1997»
15 years 10 months ago
JAM: Java Agents for Meta-Learning over Distributed Databases
In this paper, we describe the JAM system, a distributed, scalable and portable agent-based data mining system that employs a general approach to scaling data mining applications ...
Salvatore J. Stolfo, Andreas L. Prodromidis, Shell...