123 search results - page 5 / 25 » Complexity of Boolean Functions on PRAMs - Lower Bound Techn... |
STOC
2012
ACM
11 years 9 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...
DMIN
2007
13 years 8 months ago
2007
— The application of feature selection techniques greatly reduces the computational cost of classifying highdimensional data. Feature selection algorithms of varying performance ...
JMLR
2002
13 years 7 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
COLT
2001
Springer
13 years 12 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
AI
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...