Sciweavers

1268 search results - page 114 / 254
» An Algorithm for Distributed Beacon Selection
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 2 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
INFOCOM
1999
IEEE
15 years 6 months ago
Supporting Dynamic Inter-Class Resource Sharing: A Multi-Class QoS Routing Algorithm
In an integrated services network, resources are shared by multiple traffic classes. Service classes that deliver guaranteed Quality-ofService (QoS) to applications have priority ...
Qingming Ma, Peter Steenkiste
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
15 years 6 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
BMCBI
2008
142views more  BMCBI 2008»
15 years 2 months ago
Genetic weighted k-means algorithm for clustering large-scale gene expression data
Background: The traditional (unweighted) k-means is one of the most popular clustering methods for analyzing gene expression data. However, it suffers three major shortcomings. It...
Fang-Xiang Wu
IPCO
2010
125views Optimization» more  IPCO 2010»
15 years 3 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...