Sciweavers

5153 search results - page 330 / 1031
» Introduction to Randomized Algorithms
Sort
View
CJ
2011
14 years 7 months ago
Dynamic Multipath Allocation in Ad Hoc Networks
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/...
Yosi Ben-Asher, Sharoni Feldman, Moran Feldman
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
15 years 4 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
JDCTA
2010
92views more  JDCTA 2010»
14 years 11 months ago
Several Incomplete Sort Algorithms for Getting the Median Value
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
Fuguo Dong
COMPGEOM
2011
ACM
14 years 7 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
15 years 10 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland