Sciweavers

1523 search results - page 62 / 305
» The Computational Complexity of Linear Optics
Sort
View
FCT
2005
Springer
14 years 2 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
IACR
2011
94views more  IACR 2011»
12 years 8 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
CIDM
2007
IEEE
14 years 3 months ago
Data Mining of MISR Aerosol Product using Spatial Statistics
— In climate models, aerosol forcing is the major source of uncertainty in climate forcing, over the industrial period. To reduce this uncertainty, instruments on satellites have...
Tao Shi, Noel Cressie
NN
2008
Springer
114views Neural Networks» more  NN 2008»
13 years 8 months ago
Event detection and localization for small mobile robots using reservoir computing
Reservoir Computing (RC) techniques use a fixed (usually randomly created) recurrent neural network, or more generally any dynamic system, which operates at the edge of stability,...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
ISCAS
2007
IEEE
152views Hardware» more  ISCAS 2007»
14 years 3 months ago
Reduced Complexity Space-Time-Frequency Model for Multi-Channel EEG and Its Applications
— Searching for an efficient summarization of multi-channel electroencephalogram (EEG) behavior is a challenging signal analysis problem. Recently, parallel factor analysis (PAR...
Yodchanan Wongsawat, Soontorn Oraintara, K. R. Rao