5473 search results - page 799 / 1095 » On the graph isomorphism problem |
163
click to vote
VISSYM
2007
15 years 9 months ago
2007
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far ...
154
click to vote
AAAI
2007
15 years 9 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
213
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Generating alternative queries, also known as query suggestion, has long been proved useful to help a user explore and express his information need. In many scenarios, such sugges...
331
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
188
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...