Sciweavers

3247 search results - page 449 / 650
» Randomized smoothing networks
Sort
View
IEEECIT
2010
IEEE
15 years 5 months ago
Tessellating Cell Shapes for Geographical Clustering
This paper investigates the energy-saving organization of sensor nodes in large wireless sensor networks. Due to a random deployment used in many application scenarios, much more n...
Jakob Salzmann, Ralf Behnke, Dirk Timmermann
JCO
2010
101views more  JCO 2010»
15 years 5 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
TMC
2010
155views more  TMC 2010»
15 years 4 months ago
Maximizing the Lifetime of a Barrier of Wireless Sensors
—To make a network last beyond the lifetime of an individual sensor, redundant sensors must be deployed. What sleep-wakeup schedule can then be used for individual sensors so tha...
Santosh Kumar, Ten-Hwang Lai, Marc E. Posner, Pras...
TIP
2010
145views more  TIP 2010»
15 years 1 months ago
Joint Manifolds for Data Fusion
The emergence of low-cost sensing architectures for diverse modalities has made it possible to deploy sensor networks that capture a single event from a large number of vantage po...
Mark A. Davenport, Chinmay Hegde, Marco F. Duarte,...
INFOCOM
2011
IEEE
14 years 10 months ago
Incentive provision using intervention
Abstract—Overcoming the inefficiency of non-cooperative outcomes poses an important challenge for network managers in achieving efficient utilization of network resources. This...
Jaeok Park, Mihaela van der Schaar