613 search results - page 103 / 123 » Generalized Traveling Salesman Problem Reduction Algorithms |
ICALP
2010
Springer
14 years 1 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...
PKDD
2007
Springer
14 years 2 months ago
2007
Springer
Textual patterns have been used effectively to extract information from large text collections. However they rely heavily on textual redundancy in the sense that facts have to be m...
SIGIR
2004
ACM
14 years 2 months ago
2004
ACM
Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Index...
DAC
2008
ACM
14 years 9 months ago
2008
ACM
A fundamental problem in timing-driven physical synthesis is the reduction of critical paths in a design. In this work, we propose a powerful new technique that moves (and can als...
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
Many applications of supervised learning require good generalization from limited labeled data. In the Bayesian setting, we can try to achieve this goal by using an informative pr...