44 search results - page 3 / 9 » soda 2012 |
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Motivated by the problem of querying and communicating bidders’ valuations in combinatorial auctions, we study how well different classes of set functions can be sketched. More...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...