Sciweavers

5658 search results - page 336 / 1132
» An Efficient Counting Network
Sort
View
209
Voted
AHS
2006
IEEE
167views Hardware» more  AHS 2006»
16 years 28 days ago
A Novel Self-Organizing Hybrid Network Protocol for Wireless Sensor Networks
Recent development of Wireless Sensor Networks (WSN) has led to the appearance of many application specific communication protocols which must be energy-efficient. Among those pro...
Jichuan Zhao, Ahmet T. Erdogan
184
Voted
TELETRAFFIC
2007
Springer
16 years 29 days ago
Network Capacity Allocation in Service Overlay Networks
We study the capacity allocation problem in service overlay networks (SON)s with state-dependent connection routing based on revenue maximization. We formulate the dimensioning pro...
Ngok Lam, Zbigniew Dziong, Lorne Mason
166
Voted
ASUNAM
2010
IEEE
15 years 8 months ago
Fast Discovery of Reliable Subnetworks
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon
207
Voted
MOBISYS
2003
ACM
16 years 6 months ago
Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
Advances in sensing and tracking technology enable location-based applications but they also create significant privacy risks. Anonymity can provide a high degree of privacy, save...
Marco Gruteser, Dirk Grunwald
168
Voted
FSTTCS
2009
Springer
16 years 1 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi