895 search results - page 18 / 179 » Approximate convex decomposition |
103
click to vote
JMLR
2012
13 years 2 days ago
2012
We consider the minimization of a smooth loss with trace-norm regularization, which is a natural objective in multi-class and multitask learning. Even though the problem is convex...
WSC
2008
14 years 12 months ago
2008
Mathematical models are often described by multivariate functions, which are usually approximated by a sum of lower dimensional functions. A major problem is the approximation err...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
NIPS
2001
14 years 11 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
101
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...