2698 search results - page 269 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
159
click to vote
LWA
2007
15 years 8 months ago
2007
This paper describes the application of machine learning methods to determine parameters for DeLite, a readability checking tool. DeLite pinpoints text segments that are difficul...
170
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
174
click to vote
COMPGEOM
2004
ACM
16 years 1 days ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
188
click to vote
SECURWARE
2008
IEEE
16 years 1 months ago
2008
IEEE
Filtering is a very important issue in next generation networks. These networks consist of a relatively high number of resource constrained devices with very special features, suc...
147
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...