738 search results - page 94 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
130
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
There is a considerable body of work on sequence mining of Web Log Data We are using One Pass frequent Episode discovery (or FED) algorithm, takes a different approach than the tr...
HICSS
1998
IEEE
15 years 5 months ago
1998
IEEE
The design and implementation of a conceptual model, CAFE (a Categorization Assistant For E-mail), is described. The model supports the organization, searching, and retrieval of i...
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
We present an unsupervised technique for detecting unusual activity in a large video set using many simple features. No complex activity models and no supervised feature selection...
116
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
115
click to vote
ASIACRYPT
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...