79 search results - page 4 / 16 » A New Reduction from 3SAT to n-Partite Graphs |
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
AUSAI
2003
Springer
14 years 1 months ago
2003
Springer
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Wikipedia is the largest monolithic repository of human knowledge. In addition to its sheer size, it represents a new encyclopedic paradigm by interconnecting articles through hyp...
LICS
2000
IEEE
14 years 10 days ago
2000
IEEE
We provide a general method for ameliorating state explosion via symmetry reduction in certain asymmetric systems, such as systems with many similar, but not identical, processes....