Sciweavers

29908 search results - page 258 / 5982
» On the complexity of communication complexity
Sort
View
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
16 years 21 hour ago
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
Philip Hawkes, Gregory G. Rose
PCM
2004
Springer
168views Multimedia» more  PCM 2004»
15 years 12 months ago
Approximating Inference on Complex Motion Models Using Multi-model Particle Filter
Abstract. Due to its great ability of conquering clutters, which is especially useful for high-dimensional tracking problems, particle filter becomes popular in the visual trackin...
Jianyu Wang, Debin Zhao, Shiguang Shan, Wen Gao
COCO
2003
Springer
114views Algorithms» more  COCO 2003»
15 years 12 months ago
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as ...
Yijia Chen, Jörg Flum, Martin Grohe
HOLOMAS
2003
Springer
15 years 12 months ago
Complex Data Integration Based on a Multi-agent System
The expansion of the WWW and the growth of data sources lead to the proliferation of heterogeneous data (texts, images, videos, sounds and relational views). We call these data ”...
Omar Boussaid, Fadila Bentayeb, Amandine Duffoux, ...
COMPGEOM
2010
ACM
15 years 11 months ago
On the complexity of sets of free lines and line segments among balls in three dimensions
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
Marc Glisse, Sylvain Lazard