Sciweavers

4428 search results - page 545 / 886
» The Chow Parameters Problem
Sort
View
MST
2010
187views more  MST 2010»
15 years 1 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda

Publication
303views
14 years 4 months ago
Evolutionary synthesis of analog networks
he significant increase in the available computational power that took place in recent decades has been accompanied by a growing interest in the application of the evolutionary ap...
Claudio Mattiussi
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 1 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
FOCS
2008
IEEE
16 years 1 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
AAIM
2005
Springer
119views Algorithms» more  AAIM 2005»
15 years 8 months ago
Locating Performance Monitoring Mobile Agents in Scalable Active Networks
The idea of active networks has been emerged in recent years to increase the processing power inside the network. The intermediate nodes such as routers will be able to host mobile...
Amir Hossein Hadad, Mehdi Dehghan, Hossein Pedram