1996 search results - page 123 / 400 » Financial Theory 2 |
120
click to vote
COMGEO
1999
ACM
15 years 3 months ago
1999
ACM
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
119
Voted
JMLR
2010
14 years 11 months ago
2010
We introduce a new method -- the group Dantzig selector -- for high dimensional sparse regression with group structure, which has a convincing theory about why utilizing the group...
177
click to vote
FOGA
2011
14 years 7 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
183
click to vote
FOGA
2011
14 years 7 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
146
click to vote
SOFSEM
2010
Springer
16 years 1 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...