3894 search results - page 667 / 779 » Approximation Algorithms for Biclustering Problems |
110
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
151
click to vote
DAGSTUHL
2007
15 years 4 months ago
2007
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
134
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
144
click to vote
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
113
click to vote
CPAIOR
2009
Springer
15 years 10 months ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...