7006 search results - page 298 / 1402 » Approximation Algorithms |
134
Voted
CCCG
2007
15 years 5 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
137
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
142
click to vote
ESA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
132
click to vote
KDD
2000
ACM
15 years 7 months ago
2000
ACM
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
133
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...