Sciweavers

520 search results - page 73 / 104
» Subset Counting in Trees
Sort
View
AMAI
2004
Springer
14 years 1 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
ICDCS
2002
IEEE
14 years 22 days ago
A Reliable Multicast Algorithm for Mobile Ad Hoc Networks
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
Thiagaraja Gopalsamy, Mukesh Singhal, Dhabaleswar ...
FIMI
2003
210views Data Mining» more  FIMI 2003»
13 years 9 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj
ACL
1998
13 years 9 months ago
PAT-Trees with the Deletion Function as the Learning Device for Linguistic Patterns
In this study, a learning device based on the PATtree data structures was developed. The original PAT-trees were enhanced with the deletion function to emulate human learning comp...
Keh-Jiann Chen, Wen Tsuei, Lee-Feng Chien
CLEF
2010
Springer
13 years 9 months ago
ZOT! to Wikipedia Vandalism - Lab Report for PAN at CLEF 2010
Abstract This vandalism detector uses features primarily derived from a wordpreserving differencing of the text for each Wikipedia article from before and after the edit, along wit...
James White, Rebecca Maessen