Sciweavers

379 search results - page 35 / 76
» The Graham-Knowlton Problem Revisited
Sort
View
SERSCISA
2009
Springer
14 years 2 months ago
A Kademlia-Based Node Lookup System for Anonymization Networks
Node lookup mechanisms constitute an integral part of any overlay network, and hence also of anonymous communication networks. Today, most anonymizers use centralized directories, ...
Benedikt Westermann, Andriy Panchenko, Lexi Pimeni...
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
14 years 2 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
ICIP
2008
IEEE
14 years 2 months ago
Macroblock-based retransmission for error-resilient video streaming
This paper revisits the problem of source-channel coding for error-resilient video streaming. We propose a new method to enable adaptive redundancy in the bitstream: fine-grain r...
J. Christian Schmidt, Kenneth Rose
CONTEXT
2007
Springer
14 years 1 months ago
Context Modeling: Task Model and Practice Model
Contextual Graphs are a context-based formalism used in various real-world applications. They allow a uniform representation of elements of reasoning and of contexts for describing...
Patrick Brézillon
ICRA
2005
IEEE
88views Robotics» more  ICRA 2005»
14 years 1 months ago
Loop Closing in Topological Maps
— In order to create consistent maps of unknown environments, a robot must be able to recognize when it has returned to a previously visited place. In this paper, we introduce an...
Kristopher R. Beevers, Wesley H. Huang