Sciweavers

2370 search results - page 451 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ILP
2003
Springer
14 years 2 months ago
Disjunctive Learning with a Soft-Clustering Method
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
Guillaume Cleuziou, Lionel Martin, Christel Vrain
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
14 years 2 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk
PASTE
2010
ACM
14 years 2 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
PODS
2010
ACM
173views Database» more  PODS 2010»
14 years 2 months ago
Foundations of schema mapping management
In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metad...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
WEBDB
2010
Springer
173views Database» more  WEBDB 2010»
14 years 2 months ago
Manimal: Relational Optimization for Data-Intensive Programs
The MapReduce distributed programming framework is very popular, but currently lacks the optimization techniques that have been standard with relational database systems for many ...
Michael J. Cafarella, Christopher Ré