Sciweavers

3105 search results - page 82 / 621
» The Path-Packing Structure of Graphs
Sort
View
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 7 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
GD
2004
Springer
15 years 8 months ago
The Three Dimensional Logic Engine
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...
Matthew Kitching, Sue Whitesides
SCIA
2005
Springer
158views Image Analysis» more  SCIA 2005»
15 years 8 months ago
A Graph Representation of Filter Networks
Abstract. Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finit...
Björn Svensson, Mats T. Andersson, Hans Knuts...
PODC
2010
ACM
15 years 7 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
GBRPR
2005
Springer
15 years 8 months ago
Collaboration Between Statistical and Structural Approaches for Old Handwritten Characters Recognition
Abstract. In this article we try to make different kinds of information cooperate in a characters recognition system addressing old Greek and Egyptians documents. We first use a ...
Denis Arrivault, Noël Richard, Christine Fern...