Sciweavers

142 search results - page 21 / 29
» Approximate maximum weight branchings
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
RSS-based sensor localization with unknown transmit power
Received signal strength (RSS)-based single source localization when there is not a prior knowledge about the transmit power of the source is investigated. Because of nonconvex be...
Reza M. Vaghefi, Mohammad Reza Gholami, Erik G. St...
MOBICOM
2006
ACM
15 years 3 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
ICALP
2011
Springer
14 years 29 days ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
INFOCOM
2009
IEEE
15 years 4 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
15 years 9 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng