181 search results - page 34 / 37 » The Justification of Logical Theories based on Data Compress... |
POPL
2006
ACM
14 years 7 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
SIAMCOMP
2000
13 years 7 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
SEMWEB
2010
Springer
13 years 5 months ago
2010
Springer
Systems based on statistical and machine learning methods have been shown to be extremely effective and scalable for the analysis of large amount of textual data. However, in the r...
HT
2004
ACM
14 years 26 days ago
2004
ACM
In this paper, we present a model-driven methodology and toolset for automatic generation of hypertext system repositories. Our code generator, called Bamboo, is based on a Contai...
POPL
2003
ACM
14 years 7 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...