6251 search results - page 192 / 1251 » Randomness, Computability, and Density |
158
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We consider the problem of classification in nonadaptive dimensionality reduction. Specifically, we bound the increase in classification error of Fisher’s Linear Discriminant...
133
click to vote
TELETRAFFIC
2007
Springer
15 years 10 months ago
2007
Springer
We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily...
128
click to vote
IPPS
1997
IEEE
15 years 8 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
105
click to vote
MFCS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
129
click to vote
TCS
2010
15 years 2 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...