1538 search results - page 150 / 308 » Spectral Techniques in Graph Algorithms |
126
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
160
click to vote
TON
2012
13 years 6 months ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
128
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
129
click to vote
CSL
2004
Springer
15 years 3 months ago
2004
Springer
This article describes an algorithm called HyperLex that is capable of automatically determining word uses in a textbase without recourse to a dictionary. The algorithm makes use ...
154
click to vote
IWMMDBMS
1996
15 years 5 months ago
1996
We introduce a constraint-driven methodology for the automated assembly, organization and playout of presentations from multimedia databases. We use inclusion and exclusion constr...