3475 search results - page 98 / 695 » Backbones in Optimization and Approximation |
105
click to vote
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
105
Voted
STOC
1995
ACM
15 years 6 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
136
click to vote
ACL
2006
15 years 4 months ago
2006
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...
129
Voted
SDM
2003
SIAM
15 years 4 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
102
Voted
APPML
2007
15 years 2 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...