169 search results - page 18 / 34 » Distributed Approximation Algorithms for Finding 2-Edge-Conn... |
BMCBI
2010
13 years 7 months ago
2010
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
WDAG
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
DCOSS
2007
Springer
13 years 11 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...