Sciweavers

589 search results - page 88 / 118
» On the Use of Combining Rules in Relational Probability Tree...
Sort
View
ENTCS
2008
153views more  ENTCS 2008»
14 years 9 months ago
Observable Behavior of Dynamic Systems: Component Reasoning for Concurrent Objects
Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in dis...
Johan Dovland, Einar Broch Johnsen, Olaf Owe
ICPP
2005
IEEE
15 years 3 months ago
Connected k-Hop Clustering in Ad Hoc Networks
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
Shuhui Yang, Jie Wu, Jiannong Cao
CEAS
2008
Springer
14 years 11 months ago
A Campaign-based Characterization of Spamming Strategies
This paper presents a methodology for the characterization of spamming strategies based on the identification of spam campaigns. To deeply understand how spammers abuse network re...
Pedro Calais, Douglas Pires, Dorgival Olavo Guedes...
FIMI
2003
210views Data Mining» more  FIMI 2003»
14 years 11 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
DATAMINE
1999
108views more  DATAMINE 1999»
14 years 9 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri