Sciweavers

24421 search results - page 453 / 4885
» Communicating Complex Systems
Sort
View
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 4 months ago
Discrete Partitioning and Coverage Control for Gossiping Robots
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
Joseph W. Durham, Ruggero Carli, Paolo Frasca, Fra...
TDSC
2011
14 years 11 months ago
RITAS: Services for Randomized Intrusion Tolerance
— Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexitie...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
ACNS
2009
Springer
162views Cryptology» more  ACNS 2009»
15 years 11 months ago
Performance Measurements of Tor Hidden Services in Low-Bandwidth Access Networks
Abstract. Being able to access and provide Internet services anonymously is an important mechanism to ensure freedom of speech in vast parts of the world. Offering location-hidden...
Jörg Lenhard, Karsten Loesing, Guido Wirtz
ICIP
2007
IEEE
15 years 11 months ago
Complexity Control for Real-Time Video Coding
A methodology for complexity scalable video encoding and complexity control within the framework of the H.264/AVC video encoder is presented. To yield good rate-distortion perform...
Emrah Akyol, Debargha Mukherjee, Yuxin Liu
138
Voted
CIE
2006
Springer
15 years 8 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante