429 search results - page 20 / 86 » Improved Algorithms for the k Maximum-Sums Problems |
106
click to vote
STOC
2009
ACM
15 years 10 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
SIAMDM
2000
14 years 9 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
—Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far...
107
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...