Sciweavers

5606 search results - page 362 / 1122
» Randomization Techniques for Graphs.
Sort
View
JCT
2008
81views more  JCT 2008»
15 years 6 months ago
Algebraic characterization of uniquely vertex colorable graphs
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
Christopher J. Hillar, Troels Windfeldt
JSAC
2008
70views more  JSAC 2008»
15 years 6 months ago
LMMSE turbo equalization based on factor graphs
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
Qinghua Guo, Li Ping
ISCI
2007
96views more  ISCI 2007»
15 years 6 months ago
A new algorithm for removing node overlapping in graph visualization
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...
Xiaodi Huang, Wei Lai, A. S. M. Sajeev, Junbin Gao
CORR
2000
Springer
103views Education» more  CORR 2000»
15 years 6 months ago
Towards a query language for annotation graphs
The multidimensional, heterogeneous, and temporal nature of speech databases raises interesting challenges for representation and query. Recently, annotation graphs have been prop...
Steven Bird, Peter Buneman, Wang Chiew Tan
BPM
2010
Springer
126views Business» more  BPM 2010»
15 years 4 months ago
Symbolic Execution of Acyclic Workflow Graphs
Abstract. We propose a new technique to analyze the control-flow, i.e., the workflow graph of a business process model, which we call symbolic execution. We consider acyclic workfl...
Cédric Favre, Hagen Völzer