5473 search results - page 900 / 1095 » On the graph isomorphism problem |
165
click to vote
CIKM
2007
Springer
16 years 19 days ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
178
click to vote
EMMCVPR
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...
162
click to vote
STACS
2007
Springer
16 years 17 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
178
click to vote
BIBE
2006
IEEE
16 years 16 days ago
2006
IEEE
Discerning the similarity between two molecules is a challenging problem in drug discovery as well as in molecular biology. The importance of this problem is due to the fact that ...
168
click to vote
MM
2005
ACM
16 years 22 hour ago
2005
ACM
Image clustering, an important technology for image processing, has been actively researched for a long period of time. Especially in recent years, with the explosive growth of th...