4903 search results - page 51 / 981 » The Set Covering Machine |
ALGORITHMICA
2010
13 years 9 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
SBMF
2010
Springer
13 years 3 months ago
2010
Springer
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed ...
CVPR
2011
IEEE
13 years 5 months ago
2011
IEEE
Traditional computer vision and machine learning algorithms have been largely studied in a centralized setting, where all the processing is performed at a single central location....
FSTTCS
2003
Springer
14 years 2 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...