3875 search results - page 599 / 775 » Approximation algorithms for the 0-extension problem |
190
click to vote
BIBE
2005
IEEE
16 years 4 days ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
163
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
177
click to vote
IPPS
2008
IEEE
16 years 27 days ago
2008
IEEE
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
204
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
180
click to vote
MONET
2006
15 years 6 months ago
2006
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...