5473 search results - page 890 / 1095 » On the graph isomorphism problem |
192
click to vote
PAMI
2007
15 years 6 months ago
2007
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
190
click to vote
PAMI
2007
15 years 6 months ago
2007
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
124
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of automatically identifying“hotspots” on the real-time web. Concretely, we propose to identify highly-dynamic ad-hoc collections of users – what we ref...
183
click to vote
ECCC
2010
15 years 5 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
182
click to vote
EUROMED
2010
2010
Architectural Heritage Online: Ontology-Driven Website Generation for World Heritage Sites in Danger
15 years 5 months ago
We introduce an online knowledge base for semantic representation and annotation of a world heritage site in danger. For this purpose we designed ontology inside the protégé tool...