Sciweavers

70 search results - page 13 / 14
» Inferring acceptable arguments with Answer Set Programming
Sort
View
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
14 years 8 months ago
An Ad Omnia Approach to Defining and Achieving Private Data Analysis
We briefly survey several privacy compromises in published datasets, some historical and some on paper. An inspection of these suggests that the problem lies with the nature of the...
Cynthia Dwork
POPL
2005
ACM
14 years 8 months ago
Parametric polymorphism for XML
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
Haruo Hosoya, Alain Frisch, Giuseppe Castagna
WWW
2004
ACM
14 years 8 months ago
Semantic email
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
Luke McDowell, Oren Etzioni, Alon Y. Halevy, Henry...
HASKELL
2006
ACM
14 years 1 months ago
Polymorphic variants in Haskell
In languages that support polymorphic variants, a single variant value can be passed to many contexts that accept different sets of constructors. Polymorphic variants are potenti...
Koji Kagawa
AAAI
1990
13 years 9 months ago
A Proven Domain-Independent Scientific Function-Finding Algorithm
Programs such as Bacon, Abacus, Coper, Kepler and others are designed to find functional relationships of scientific significance in numerical data without relying on the deep dom...
Cullen Schaffer