7228 search results - page 331 / 1446 » From Algorithmic to Subjective Randomness |
165
Voted
JACM
2006
15 years 4 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
143
Voted
TOC
2008
15 years 4 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
163
Voted
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
172
Voted
CORR
2011
Springer
14 years 12 months ago
2011
Springer
This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to find nonnegative matrices X and Y from a subset of entries o...
135
click to vote
JSC
2010
15 years 3 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...