Sciweavers

5592 search results - page 172 / 1119
» On Random Betweenness Constraints
Sort
View
149
Voted
IPTPS
2005
Springer
15 years 10 months ago
Hybrid Overlay Structure Based on Random Walks
Application-level multicast on structured overlays often suffer several drawbacks: 1) The regularity of the architecture makes it difficult to adapt to topology changes; 2) the u...
Ruixiong Tian, Yongqiang Xiong, Qian Zhang, Bo Li,...
ISCIS
2005
Springer
15 years 10 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
MFCS
2005
Springer
15 years 10 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
157
Voted
LATA
2010
Springer
15 years 10 months ago
A Randomized Numerical Aligner (rNA)
With the advent of new sequencing technologies able to produce an enormous quantity of short genomic sequences, new tools able to search for them inside a references sequence genom...
Alberto Policriti, Alexandru I. Tomescu, Francesco...
165
Voted
ER
2001
Springer
136views Database» more  ER 2001»
15 years 9 months ago
A Randomized Approach for the Incremental Design of an Evolving Data Warehouse
A Data Warehouse (DW) can be used to integrate data from multiple distributed data sources. A DW can be seen as a set of materialized views that determine its schema and its conten...
Dimitri Theodoratos, Theodore Dalamagas, Alkis Sim...