Sciweavers

767 search results - page 120 / 154
» On Clustering Using Random Walks
Sort
View
BMCBI
2005
127views more  BMCBI 2005»
13 years 7 months ago
Genomes are covered with ubiquitous 11 bp periodic patterns, the "class A flexible patterns"
Background: The genomes of prokaryotes and lower eukaryotes display a very strong 11 bp periodic bias in the distribution of their nucleotides. This bias is present throughout a g...
Etienne Larsabal, Antoine Danchin
PVLDB
2010
220views more  PVLDB 2010»
13 years 2 months ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel
TON
1998
103views more  TON 1998»
13 years 7 months ago
Using name-based mappings to increase hit rates
—Clusters of identical intermediate servers are often created to improve availability and robustness in many domains. The use of proxy servers for the World Wide Web (WWW) and of...
David Thaler, Chinya V. Ravishankar
TPDS
2002
173views more  TPDS 2002»
13 years 7 months ago
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an...
Stephanie Lindsey, Cauligi S. Raghavendra, Krishna...
CLUSTER
2009
IEEE
14 years 2 months ago
Oblivious routing schemes in extended generalized Fat Tree networks
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
Germán Rodríguez, Cyriel Minkenberg,...