Sciweavers

1856 search results - page 344 / 372
» Formal Dialectic Specification
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 2 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2005
ACM
125views Data Mining» more  KDD 2005»
16 years 2 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
POPL
2006
ACM
16 years 2 months ago
Harmless advice
This paper defines an object-oriented language with harmless aspect-oriented advice. A piece of harmless advice is a computation that, like ordinary aspect-oriented advice, execut...
Daniel S. Dantas, David Walker
POPL
2005
ACM
16 years 2 months ago
Permission accounting in separation logic
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
Richard Bornat, Cristiano Calcagno, Peter W. O'Hea...
SIGMOD
2009
ACM
132views Database» more  SIGMOD 2009»
16 years 2 months ago
Core schema mappings
Research has investigated mappings among data sources under two perspectives. On one side, there are studies of practical tools for schema mapping generation; these focus on algor...
Giansalvatore Mecca, Paolo Papotti, Salvatore Raun...