Sciweavers

40 search results - page 7 / 8
» nc 2010
Sort
View
SPAA
2010
ACM
13 years 10 months ago
Parallel approximation algorithms for facility-location problems
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
Guy E. Blelloch, Kanat Tangwongsan
IWCMC
2010
ACM
13 years 7 months ago
Joint network coding and beamforming techniques for downlink channels
We propose a joint optimization of Network Coding and MIMO techniques to improve the downlink channel throughput of a wireless base station. Specifically, we consider a MIMO base...
Monchai Lertsutthiwong, Thinh Nguyen, Bechir Hamda...
ECCC
2010
98views more  ECCC 2010»
13 years 3 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 2 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
STACS
2010
Springer
14 years 9 days ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey