Sciweavers

3247 search results - page 461 / 650
» Randomized smoothing networks
Sort
View
ICALP
2009
Springer
16 years 6 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
MOBIHOC
2005
ACM
16 years 6 months ago
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
Rajagopal Iyengar, Koushik Kar, Suman Banerjee
EDBT
2010
ACM
246views Database» more  EDBT 2010»
16 years 1 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
INFOCOM
2008
IEEE
16 years 28 days ago
Capacity of Hybrid Cellular-Ad Hoc Data Networks
—In this paper, towards improving spatial reuse in a cellular network, we consider augmenting it with wireless ad hoc connectivity. The coverage area of each base-station is redu...
Lap Kong Law, Srikanth V. Krishnamurthy, Michalis ...
SASN
2004
ACM
15 years 12 months ago
Source-location privacy in energy-constrained sensor network routing
As sensor-driven applications become increasingly integrated into our lives, issues related to sensor privacy will become increasingly important. Although many privacy-related iss...
Celal Ozturk, Yanyong Zhang, Wade Trappe