5115 search results - page 499 / 1023 » On Randomized Lanczos Algorithms |
192
click to vote
INFOCOM
1998
IEEE
1998
IEEE
A Stochastic Approximation Approach for Max-Min Fair Adaptive Rate Control of ABR Sessions with MCRs
15 years 11 months ago
The ABR sessions in an ATM network share the bandwidth left over after guaranteeing service to CBR and VBR traffic. Hence the bandwidth available to ABR sessions is randomly varyi...
188
click to vote
WG
1993
Springer
15 years 11 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
184
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
This paper contributes tothe study of nonlinear dynamical systems from a computational perspective. These systems are inherently more powerful than their linear counterparts (such...
145
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
188
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...