534 search results - page 36 / 107 » Efficient polynomial L-approximations |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
ECCC
2006
13 years 7 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
STOC
1998
ACM
14 years 1 days ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
ICALP
1998
Springer
14 years 1 days ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
CCS
2007
ACM
13 years 11 months ago
2007
ACM
Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effe...