Sciweavers

23557 search results - page 4326 / 4712
» Distributed Computing - Introduction
Sort
View
MOBIHOC
2004
ACM
16 years 3 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
MOBIHOC
2003
ACM
16 years 3 months ago
Mobility helps security in ad hoc networks
Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We...
Jean-Pierre Hubaux, Levente Buttyán, Srdjan...
ICS
2010
Tsinghua U.
16 years 1 months ago
Robustly Leveraging Collusion in Combinatorial Auctions
feuse of its devstting eets in utions nd other mehnismsD ollusion is prohiited nd leglly proseutedF etD olluders hve lwys existedD nd my ontinue to existF e thus rise the followin...
Jing Chen, Silvio Micali, Paul Valiant
PPOPP
2010
ACM
16 years 1 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
PODC
2009
ACM
16 years 1 months ago
Memory models: a case for rethinking parallel languages and hardware
The era of parallel computing for the masses is here, but writing correct parallel programs remains far more difficult than writing sequential programs. Aside from a few domains,...
Sarita V. Adve
« Prev « First page 4326 / 4712 Last » Next »