Sciweavers

11063 search results - page 56 / 2213
» On the existence of universal models
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
USPACOR: Universal sparsity-controlling outlier rejection
The recent upsurge of research toward compressive sampling and parsimonious signal representations hinges on signals being sparse, either naturally, or, after projecting them on a...
Georgios B. Giannakis, Gonzalo Mateos, Shahrokh Fa...
CAV
2006
Springer
133views Hardware» more  CAV 2006»
14 years 1 months ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 7 months ago
Universal Rate-Efficient Scalar Quantization
Scalar quantization is the most practical and straightforward approach to signal quantization. However, it has been shown that scalar quantization of oversampled or Compressively ...
Petros Boufounos
TREC
2004
13 years 11 months ago
University of Glasgow at TREC 2004: Experiments in Web, Robust, and Terabyte Tracks with Terrier
With our participation in TREC2004, we test Terrier, a modular and scalable Information Retrieval framework, in three tracks. For the mixed query task of the Web track, we employ ...
Vassilis Plachouras, Ben He, Iadh Ounis
GRID
2004
Springer
14 years 3 months ago
Walden: A Scalable Solution for Grid Account Management
— A large and diverse consortium of grid clusters, as can be found in a university setting, requires a flexible authorization model that is scalable, extensible and easy to admi...
Beth A. Kirschner, Thomas J. Hacker, William A. Ad...