Sciweavers

2996 search results - page 69 / 600
» Numberings and Randomness
Sort
View
PODS
2005
ACM
164views Database» more  PODS 2005»
14 years 10 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
ICB
2009
Springer
142views Biometrics» more  ICB 2009»
14 years 2 months ago
A Random Network Ensemble for Face Recognition
In this paper, we propose a random network ensemble for face recognition problem, particularly for images with a large appearance variation and with a limited number of training se...
Kwontaeg Choi, Kar-Ann Toh, Hyeran Byun
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 11 months ago
Reconstructing strings from random traces
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andre...
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
14 years 4 months ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
FOCS
2003
IEEE
14 years 3 months ago
On the Implementation of Huge Random Objects
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
Oded Goldreich, Shafi Goldwasser, Asaf Nussboim