Sciweavers

2542 search results - page 276 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
ATAL
2011
Springer
14 years 15 days ago
Incentive design for adaptive agents
We consider a setting in which a principal seeks to induce an adaptive agent to select a target action by providing incentives on one or more actions. The agent maintains a belief...
Yiling Chen, Jerry Kung, David C. Parkes, Ariel D....
SIGCOMM
2012
ACM
13 years 3 months ago
Network-aware service placement in a distributed cloud environment
We consider a system of compute and storage resources geographically distributed over a large number of locations connected via a wide-area network. By distributing the resources,...
Moritz Steiner, Bob Gaglianello Gaglianello, Vijay...
SPAA
2010
ACM
15 years 5 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
ANCS
2009
ACM
14 years 10 months ago
LaFA: lookahead finite automata for scalable regular expression detection
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
108
Voted
IPSN
2005
Springer
15 years 6 months ago
Matched source-channel communication for field estimation in wireless sensor networks
Abstract— Sensing, processing and communication must be jointly optimized for efficient operation of resource-limited wireless sensor networks. We propose a novel source-channel...
Waheed Uz Zaman Bajwa, Akbar M. Sayeed, Robert D. ...