563 search results - page 57 / 113 » Computing approximate PSD factorizations |
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
NIPS
2000
13 years 11 months ago
2000
We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences...
IJCAI
1997
13 years 11 months ago
1997
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
BILDMED
2008
13 years 11 months ago
2008
We present a novel method for iterative reconstruction of high resolution images. Our method is based on the observation that constant regions in an image can be represented at muc...
ACL
2011
13 years 1 months ago
2011
We learn a joint model of sentence extraction and compression for multi-document summarization. Our model scores candidate summaries according to a combined linear model whose fea...