2157 search results - page 57 / 432 » Optimal Fast Hashing |
STRINGOLOGY
2008
15 years 5 months ago
2008
121
click to vote
IJCAI
2001
15 years 5 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
144
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
114
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We give a space-optimal algorithm with update time O(log2 (1/) log log(1/)) for (1