Sciweavers

23589 search results - page 4458 / 4718
» Uncheatable Distributed Computations
Sort
View
MOBIHOC
2003
ACM
16 years 6 months ago
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
On demand routing protocols provide scalable and costeffective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate ...
Chao Gui, Prasant Mohapatra
MOBIHOC
2003
ACM
16 years 6 months ago
On the capacity improvement of ad hoc wireless networks using directional antennas
The capacity of ad hoc wireless networks is constrained by the interference between concurrent transmissions from neighboring nodes. Gupta and Kumar have shown that the capacity o...
Su Yi, Yong Pei, Shivkumar Kalyanaraman
WSDM
2010
ACM
266views Data Mining» more  WSDM 2010»
16 years 4 months ago
Gathering and Ranking Photos of Named Entities with High Precision, High Recall, and Diversity
Knowledge-sharing communities like Wikipedia and automated extraction methods like those of DBpedia enable the construction of large machine-processible knowledge bases with relat...
Bilyana Taneva, Mouna Kacimi, Gerhard Weikum
ICS
2010
Tsinghua U.
16 years 4 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
PPOPP
2010
ACM
16 years 4 months ago
Is transactional programming actually easier?
Chip multi-processors (CMPs) have become ubiquitous, while tools that ease concurrent programming have not. The promise of increased performance for all applications through ever ...
Christopher J. Rossbach, Owen S. Hofmann, Emmett W...
« Prev « First page 4458 / 4718 Last » Next »