2584 search results - page 296 / 517 » On the Forward Checking Algorithm |
164
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
151
click to vote
ISSAC
2007
Springer
16 years 22 days ago
2007
Springer
Given a lattice basis of n vectors in Zn, we propose an algorithm using 12n3 + O(n2) floating point operations for checking whether the basis is LLL-reduced. If the basis is redu...
171
click to vote
WEA
2005
Springer
16 years 2 days ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
167
click to vote
ICTAI
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
192
Voted
SIGIR
2006
ACM
16 years 16 days ago
2006
ACM
Text message stream is a newly emerging type of Web data which is produced in enormous quantities with the popularity of Instant Messaging and Internet Relay Chat. It is benefici...