Sciweavers

2168 search results - page 307 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
16 years 3 months ago
Constraint programming for itemset mining
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
Luc De Raedt, Tias Guns, Siegfried Nijssen
KDD
2004
ACM
127views Data Mining» more  KDD 2004»
16 years 3 months ago
A generative probabilistic approach to visualizing sets of symbolic sequences
There is a notable interest in extending probabilistic generative modeling principles to accommodate for more complex structured data types. In this paper we develop a generative ...
Peter Tiño, Ata Kabán, Yi Sun
104
Voted
CHI
2005
ACM
16 years 3 months ago
Automatic generation of high coverage usability tests
Software systems are often complex in the number of features that are available through the user interface and consequently, the number of interactions that can occur. Such system...
Renée C. Bryce
ICFP
2008
ACM
16 years 3 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
126
Voted
WIA
2009
Springer
15 years 10 months ago
FAdo and GUItar
FAdo is an ongoing project which aims to provide a set of tools for symbolic manipulation of formal languages. To allow highlevel programming with complex data structures, easy pro...
André Almeida, Marco Almeida, José A...