Sciweavers

20 search results - page 4 / 4
» What Makes a Chair a Chair
Sort
View
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
13 years 10 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit eļ¬ƒcient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
MOBIHOC
2004
ACM
14 years 4 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
MOBICOM
2004
ACM
13 years 10 months ago
A scalable model for channel access protocols in multihop ad hoc networks
A new modeling framework is introduced for the analytical study of medium access control (MAC) protocols operating in multihop ad hoc networks. The model takes into account the eļ...
Marcelo M. Carvalho, Jose Joaquin Garcia-Luna-Acev...
COLING
2010
12 years 11 months ago
Multiword Expressions in the wild? The mwetoolkit comes in handy
The mwetoolkit is a tool for automatic extraction of Multiword Expressions (MWEs) from monolingual corpora. It both generates and validates MWE candidates. The generation is based...
Carlos Ramisch, Aline Villavicencio, Christian Boi...
PODC
2009
ACM
14 years 1 months ago
The wireless synchronization problem
In this paper, we study the wireless synchronization problem which requires devices activated at diļ¬€erent times on a congested single-hop radio network to synchronize their roun...
Shlomi Dolev, Seth Gilbert, Rachid Guerraoui, Fabi...