Sciweavers

440 search results - page 24 / 88
» On partial randomness
Sort
View
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
14 years 11 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
TSP
2008
166views more  TSP 2008»
14 years 11 months ago
A Unifying Discussion of Correlation Analysis for Complex Random Vectors
The assessment of multivariate association between two complex random vectors is considered. A number of correlation coefficients based on three popular correlation analysis techni...
Peter J. Schreier
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 3 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
ICCV
2009
IEEE
1048views Computer Vision» more  ICCV 2009»
16 years 4 months ago
Face Recognition With Contiguous Occlusion Using Markov Random Fields
Partially occluded faces are common in many applications of face recognition. While algorithms based on sparse representation have demonstrated promising results, they achieve t...
Zihan Zhou, Andrew Wagner, Hossein Mobahi, John Wr...
CDC
2009
IEEE
181views Control Systems» more  CDC 2009»
15 years 4 months ago
Stability of switched linear systems and the convergence of random products
— In this paper we give conditions that a discrete time switched linear systems must satisfy if it is stable. We do this by calculating the mean and covariance of the set of matr...
Ning Wang, Magnus Egerstedt, Clyde F. Martin