6 search results - page 1 / 2 » The Cardinality of an Oracle in Blum-Shub-Smale Computation |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
STOC
2012
ACM
12 years 1 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
VLDB
2007
ACM
14 years 11 months ago
2007
ACM
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
FOCS
2009
IEEE
14 years 5 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...