Sciweavers

13621 search results - page 283 / 2725
» Computability and Complexity in Self-assembly
Sort
View
KES
2006
Springer
15 years 6 months ago
Symbiotic Sensor Networks in Complex Underwater Terrains: A Simulation Framework
Abstract. This paper presents a new multi-agent physics-based simulation framework (DISCOVERY), supporting experiments with self-organizing underwater sensor and actuator networks....
Vadim Gerasimov, Gerry Healy, Mikhail Prokopenko, ...
CORR
2000
Springer
134views Education» more  CORR 2000»
15 years 6 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
TOG
2002
127views more  TOG 2002»
15 years 6 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers
IAJIT
2010
107views more  IAJIT 2010»
15 years 5 months ago
Low Latency, High Throughput, and Less Complex VLSI Architecture for 2D-DFT
: This paper proposes a pipelined, systolic architecture for two- dimensional discrete Fourier transform computation which is highly concurrent. The architecture consists of two, o...
Sohil Shah, Preethi Venkatesan, Deepa Sundar, Muni...
LATINCRYPT
2010
15 years 5 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...