Sciweavers

453 search results - page 81 / 91
» From restrictive to prescriptive design
Sort
View
159
Voted
ICLP
2009
Springer
15 years 10 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...
KDD
2005
ACM
125views Data Mining» more  KDD 2005»
15 years 10 months ago
Email data cleaning
Addressed in this paper is the issue of `email data cleaning' for text mining. Many text mining applications need take emails as input. Email data is usually noisy and thus i...
Jie Tang, Hang Li, Yunbo Cao, ZhaoHui Tang
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
15 years 10 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
PODS
2008
ACM
165views Database» more  PODS 2008»
15 years 9 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
ICFP
2008
ACM
15 years 9 months ago
Flask: staged functional programming for sensor networks
Severely resource-constrained devices present a confounding challenge to the functional programmer: we are used to having powerful ion facilities at our fingertips, but how can we...
Geoffrey Mainland, Greg Morrisett, Matt Welsh