Sciweavers

3708 search results - page 237 / 742
» Approximating Betweenness Centrality
Sort
View
INFOCOM
2008
IEEE
16 years 29 days ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
15 years 6 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
16 years 6 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
INFOCOM
2009
IEEE
16 years 1 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...
ICASSP
2008
IEEE
16 years 1 months ago
Mutual information based relevance network analysis: a Parkinson'S disease study
Monitoring the dynamics of networks in the brain is of central importance in normal and disease states. Current methods of detecting networks in the recorded EEG such as correlati...
Pamela Wen-Hsin Lee, Z. Jane Wang, Martin J. McKeo...