Sciweavers

957 search results - page 75 / 192
» A Probability Model for Combining Ranks
Sort
View
PASTE
2010
ACM
15 years 9 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
16 years 4 months ago
Probabilistic author-topic models for information discovery
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
Mark Steyvers, Padhraic Smyth, Michal Rosen-Zvi, T...
EJWCN
2010
229views more  EJWCN 2010»
14 years 11 months ago
Throughput-Efficient Dynamic Coalition Formation in Distributed Cognitive Radio Networks
We formulate the problem of distributed throughput-efficient sensing in cognitive radio (CR) networks as a dynamic coalition formation game based on a Markovian model. The propose...
Zaheer Khan, Janne J. Lehtomäki, Marian Codre...
MMB
2004
Springer
149views Communications» more  MMB 2004»
15 years 9 months ago
Relating Query Popularity and File Replication in the Gnutella Peer-to-Peer Network
In this paper, we characterize the user behavior in a peer-to-peer (P2P) file sharing network. Our characterization is based on the results of an extensive passive measurement stu...
Alexander Klemm, Christoph Lindemann, Oliver P. Wa...
SSDBM
2000
IEEE
87views Database» more  SSDBM 2000»
15 years 8 months ago
A Tool for Nesting and Clustering Large Objects
In implementations of non-standard database systems, large objects are often embedded within an aggregate of different types, i.e. a tuple. For a given size and access probabilit...
Stefan Dieker, Ralf Hartmut Güting, Miguel Ro...