Sciweavers

159 search results - page 20 / 32
» Small world models for social network algorithms testing
Sort
View
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
11 years 11 months ago
Pricing cloud bandwidth reservations under demand uncertainty
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
Di Niu, Chen Feng, Baochun Li
INFOCOM
2006
IEEE
14 years 2 months ago
Detecting Stations Cheating on Backoff Rules in 802.11 Networks Using Sequential Analysis
— As the commercial success of the IEEE 802.11 protocol has made wireless infrastructure widely deployed, user organizations are increasingly concerned about the new vulnerabilit...
Yanxia Rong, Sang Kyu Lee, Hyeong-Ah Choi
SENSYS
2010
ACM
13 years 6 months ago
Efficient diagnostic tracing for wireless sensor networks
Wireless sensor networks (WSNs) are hard to program due to unconventional programming models used to satisfy stringent resource constraints. The common event-driven concurrent pro...
Vinaitheerthan Sundaram, Patrick Th. Eugster, Xian...
ICALP
2009
Springer
14 years 9 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 12 days ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert