Sciweavers

13977 search results - page 360 / 2796
» Evolution in complex systems
Sort
View
SIGIR
2006
ACM
16 years 22 days ago
Answering complex questions with random walk models
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
Sanda M. Harabagiu, V. Finley Lacatusu, Andrew Hic...
153
Voted
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
16 years 6 days 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
GRAPHICSINTERFACE
2003
15 years 8 months ago
Interactive Point-based Modeling of Complex Objects from Images
Modeling complex realistic objects is a difficult and time consuming process. Nevertheless, with improvements in rendering speed and quality, more and more applications require s...
Pierre Poulin, Marc Stamminger, François Du...
FUIN
2008
123views more  FUIN 2008»
15 years 6 months ago
Interface Automata with Complex Actions: Limiting Interleaving in Interface Automata
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...
Shahram Esmaeilsabzali, Nancy A. Day, Farhad Mavad...
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 5 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks