1647 search results - page 233 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
96
Voted
ICCV
2005
IEEE
16 years 4 months ago
2005
IEEE
A wide range of low level vision problems have been formulated in terms of finding the most probable assignment of a Markov Random Field (or equivalently the lowest energy configu...
121
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
125
Voted
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
118
click to vote
ALT
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
136
Voted
KDD
2008
ACM
16 years 2 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...