672 search results - page 29 / 135 » Almost Optimal Dispersers |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We analyse the prequential plug-in codes relative to one-parameter exponential families M. We show that if data are sampled i.i.d. from some distribution outside M, then the redund...
SIGMETRICS
2008
ACM
13 years 9 months ago
2008
ACM
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
JNW
2007
13 years 9 months ago
2007
— We propose a mathematical programming model of the routing problem in multi-hop wireless networks that takes into account quality of service requirements considering bandwidth ...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
CSB
2005
IEEE
14 years 3 months ago
2005
IEEE
Traditional phylogenetic tree reconstruction is based on point mutations of a single gene. This approach is hardly suitable for genomes whose genes are almost identical and hardly...