5785 search results - page 263 / 1157 » Approximability of Probability Distributions |
155
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
142
click to vote
SDM
2003
SIAM
15 years 5 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
145
click to vote
ANOR
2004
15 years 4 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
152
click to vote
JGAA
2000
15 years 4 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
163
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...