Sciweavers

604 search results - page 112 / 121
» The Hardness of Metric Labeling
Sort
View
MOBICOM
2003
ACM
14 years 1 months ago
Towards realistic mobility models for mobile ad hoc networks
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
Amit P. Jardosh, Elizabeth M. Belding-Royer, Kevin...
SENSYS
2003
ACM
14 years 1 months ago
CODA: congestion detection and avoidance in sensor networks
Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is l...
Chieh-Yih Wan, Shane B. Eisenman, Andrew T. Campbe...
SIGCOMM
2003
ACM
14 years 1 months ago
Network routing with path vector protocols: theory and applications
Path vector protocols are currently in the limelight, mainly because the inter-domain routing protocol of the Internet, BGP (Border Gateway Protocol), belongs to this class. In th...
João L. Sobrinho
SIGIR
2003
ACM
14 years 1 months ago
Salton Award Lecture - Information retrieval and computer science: an evolving relationship
Following the tradition of these acceptance talks, I will be giving my thoughts on where our field is going. Any discussion of the future of information retrieval (IR) research, h...
W. Bruce Croft
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 19 days ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis