1096 search results - page 40 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
101
click to vote
AI
2002
Springer
14 years 9 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
100
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
ISVLSI
2002
IEEE
15 years 2 months ago
2002
IEEE
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
3DPVT
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a stereo algorithm that achieves high quality results while maintaining real-time performance. The key idea is simple: we introduce an adaptive aggregation step in a dy...