7129 search results - page 283 / 1426 » Approximation Algorithms for Treewidth |
145
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
140
click to vote
CPM
1999
Springer
15 years 8 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
133
click to vote
CSDA
2010
15 years 4 months ago
2010
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
170
click to vote
JMLR
2010
14 years 11 months ago
2010
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
169
click to vote
CVPR
1997
IEEE
16 years 6 months ago
1997
IEEE
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...