Sciweavers

400 search results - page 70 / 80
» Lower Bounds Using Kolmogorov Complexity
Sort
View
ECCC
2000
158views more  ECCC 2000»
13 years 8 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
MST
2002
169views more  MST 2002»
13 years 8 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...
MA
2010
Springer
132views Communications» more  MA 2010»
13 years 7 months ago
Model selection by sequentially normalized least squares
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
Jorma Rissanen, Teemu Roos, Petri Myllymäki
CISS
2011
IEEE
13 years 15 days ago
Noncoherent compressive sensing with application to distributed radar
—We consider a multi-static radar scenario with spatially dislocated receivers that can individually extract delay information only. Furthermore, we assume that the receivers are...
Christian R. Berger, Josee M. F. Moura
ANOR
2011
117views more  ANOR 2011»
13 years 10 days ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover