3422 search results - page 82 / 685 » Random Subset Optimization |
139
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
126
click to vote
SODA
1998
ACM
15 years 3 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
115
click to vote
COCO
2007
Springer
15 years 8 months ago
2007
Springer
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 ...
112
click to vote
FOCS
1989
IEEE
15 years 6 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
113
click to vote
ESANN
2007
15 years 3 months ago
2007
In many applications, one is interested to detect certain patterns in random process signals. We consider a class of random process signals which contain sub similarities at rando...