1389 search results - page 175 / 278 » Improved Approximation Algorithms for Label Cover Problems |
141
click to vote
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
We consider object recognition as the process of attaching meaningful labels to specific regions of an image, and propose a model that learns spatial relationships between objects....
140
click to vote
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
111
click to vote
NIPS
2003
15 years 4 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
122
click to vote
FUIN
2006
15 years 3 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
124
click to vote
SIGECOM
2009
ACM
15 years 9 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...