Sciweavers

829 search results - page 140 / 166
» Bandit Algorithms for Tree Search
Sort
View
MSN
2007
Springer
14 years 2 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
ITCC
2003
IEEE
14 years 1 months ago
Dictionary-Based Fast Transform for Text Compression
In this paper we present StarNT, a dictionary-based fast lossless text transform algorithm. With a static generic dictionary, StarNT achieves a superior compression ratio than alm...
Weifeng Sun, Nan Zhang 0005, Amar Mukherjee
FIMI
2003
210views Data Mining» more  FIMI 2003»
13 years 10 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
FORTE
2000
13 years 9 months ago
Systematic Performance Evaluation of Multipoint Protocols
The adventof multipoint(multicast-based) applications and the growth and complexity of the Internet has complicated network protocol design and evaluation. In this paper, we prese...
Ahmed Helmy, Sandeep K. S. Gupta, Deborah Estrin, ...
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 2 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey