Sciweavers

1523 search results - page 104 / 305
» The Computational Complexity of Linear Optics
Sort
View
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 6 months ago
Mining Complex Spatio-Temporal Sequence Patterns.
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
Florian Verhein
TSP
2010
13 years 3 months ago
Low complexity equalization for doubly selective channels modeled by a basis expansion
We propose a novel equalization method for doubly selective wireless channels, whose taps are represented by an arbitrary Basis Expansion Model (BEM). We view such a channel in the...
Tomasz Hrycak, Saptarshi Das, Gerald Matz, Hans G....
UAI
2008
13 years 10 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
14 years 2 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
TSMC
2008
182views more  TSMC 2008»
13 years 8 months ago
Incremental Linear Discriminant Analysis for Face Recognition
Abstract--Dimensionality reduction methods have been successfully employed for face recognition. Among the various dimensionality reduction algorithms, linear (Fisher) discriminant...
Haitao Zhao, Pong Chi Yuen