3874 search results - page 525 / 775 » Approximation Algorithms for k-hurdle Problems |
137
click to vote
DAM
2011
14 years 11 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
215
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
143
click to vote
CIKM
2011
Springer
14 years 4 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
155
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
150
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...