2137 search results - page 231 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
183
click to vote
MST
2010
15 years 4 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
147
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
184
click to vote
CISS
2008
IEEE
16 years 26 days ago
2008
IEEE
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
142
Voted
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
200
click to vote
TNN
2010
15 years 1 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...