Sciweavers

140 search results - page 26 / 28
» soda 2010
Sort
View
TVLSI
2010
15 years 13 days ago
A Low-Power DSP for Wireless Communications
This paper proposes a low-power high-throughput digital signal processor (DSP) for baseband processing in wireless terminals. It builds on our earlier architecture--Signal processi...
Hyunseok Lee, Chaitali Chakrabarti, Trevor N. Mudg...
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
15 years 5 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
STACS
2010
Springer
16 years 22 days ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn
ICALP
2010
Springer
15 years 10 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
TALG
2010
74views more  TALG 2010»
15 years 4 months ago
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
Timothy M. Chan