7129 search results - page 38 / 1426 » Approximation Algorithms for Treewidth |
137
click to vote
ICDE
2012
IEEE
13 years 5 days ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
102
click to vote
PAMI
2012
13 years 5 days ago
2012
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
103
click to vote
FCT
2003
Springer
15 years 2 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
ISAAC
2009
Springer
15 years 2 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
200
click to vote
JMLR
2012
13 years 5 days ago
2012
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...