1429 search results - page 95 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
IPSN
2009
Springer
14 years 4 months ago
2009
Springer
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—In multi-rate wireless LANs, throughput-based fair bandwidth allocation can lead to drastically reduced aggregate throughput. To balance aggregate throughput while serving users...
PPSC
1997
13 years 10 months ago
1997
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
NIPS
1992
13 years 10 months ago
1992
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
SIGECOM
2010
ACM
13 years 9 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....