Sciweavers

373 search results - page 61 / 75
» Counting in Trees for Free
Sort
View
EUROPAR
2007
Springer
15 years 6 months ago
Compositional Approach Applied to Loop Specialization
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
Lamia Djoudi, Jean-Thomas Acquaviva, Denis Barthou
AMAI
2004
Springer
15 years 5 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
15 years 4 months 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»
15 years 1 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
CLEF
2010
Springer
15 years 28 days 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