7129 search results - page 557 / 1426 » Approximation Algorithms for Treewidth |
235
click to vote
BIBE
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper describes a design and implementation of the Smith-Waterman algorithm accelerated on the graphics processing unit (GPU). Our method is implemented using compute uniï...
208
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
Consider a scenario where a distributed signal is sparse and is acquired by various sensors that see different versions. Thus, we have a set of sparse signals with both some commo...
201
Voted
ADHOCNOW
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
209
click to vote
COCOON
2007
Springer
16 years 1 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
227
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...