Sciweavers

2125 search results - page 72 / 425
» On Graph Complexity
Sort
View
EMNLP
2008
13 years 9 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
14 years 1 months ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel
APVIS
2007
13 years 9 months ago
Level-of-detail visualization of clustered graph layouts
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit ...
Michael Balzer, Oliver Deussen
AIMS
2007
Springer
14 years 1 months ago
Graph Models of Critical Infrastructure Interdependencies
Critical infrastructures are interconnected on multiple levels, and due to their size models with acceptable computational complexity and adequate modeling capacities must be devel...
Nils Kalstad Svendsen, Stephen D. Wolthusen
WEA
2004
Springer
110views Algorithms» more  WEA 2004»
14 years 1 months ago
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
David J. Pearce, Paul H. J. Kelly