2168 search results - page 189 / 434 » Randomized Algorithms and Complexity Theory |
134
Voted
ALGOSENSORS
2007
Springer
15 years 9 months ago
2007
Springer
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
129
Voted
NIPS
2008
15 years 5 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
126
Voted
SIGIR
2008
ACM
15 years 3 months ago
2008
ACM
We consider the problem of large scale retrieval evaluation. Recently two methods based on random sampling were proposed as a solution to the extensive effort required to judge te...
110
Voted
SIAMJO
2010
14 years 10 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
168
Voted
ENTCS
2006
15 years 3 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...