Sciweavers

1511 search results - page 90 / 303
» Randomness, lowness and degrees
Sort
View
CVPR
2005
IEEE
16 years 8 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang
FOCS
1994
IEEE
15 years 9 months ago
Randomized and deterministic algorithms for geometric spanners of small diameter
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
ASPDAC
2008
ACM
94views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Robust on-chip bus architecture synthesis for MPSoCs under random tasks arrival
A major trend in a modern system-on-chip design is a growing system complexity, which results in a sharp increase of communication traffic on the on-chip communication bus architec...
Sujan Pandey, Rolf Drechsler
FPGA
2008
ACM
146views FPGA» more  FPGA 2008»
15 years 7 months ago
FPGA-optimised high-quality uniform random number generators
This paper introduces a method of constructing random number generators from four of the basic primitives provided by FPGAs: Flip-Flips, Lookup-Tables, Shift Registers, and RAMs. ...
David B. Thomas, Wayne Luk
RSA
2002
99views more  RSA 2002»
15 years 5 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott