Sciweavers

2479 search results - page 263 / 496
» Quantum complexity theory
Sort
View
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
16 years 7 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 7 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
CHI
2005
ACM
16 years 7 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
CHI
2004
ACM
16 years 7 months ago
Passwords you'll never forget, but can't recall
We identify a wide range of human memory phenomena as potential certificates of identity. These "imprinting" behaviors are characterized by vast capacity for complex exp...
Daphna Weinshall, Scott Kirkpatrick
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
16 years 7 months ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin