Sciweavers

2239 search results - page 119 / 448
» Computing with abstract matrix structures
Sort
View
115
Voted
TOMS
2011
101views more  TOMS 2011»
14 years 10 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...
ICANN
2007
Springer
15 years 9 months ago
Structure Learning with Nonparametric Decomposable Models
Abstract. We present a novel approach to structure learning for graphical models. By using nonparametric estimates to model clique densities in decomposable models, both discrete a...
Anton Schwaighofer, Mathäus Dejori, Volker Tr...
CAISE
1999
Springer
15 years 7 months ago
Applying Graph Reduction Techniques for Identifying Structural Conflicts in Process Models
Abstract. The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for workflows, we show how a control flow specificati...
Wasim Sadiq, Maria E. Orlowska
BIS
2008
92views Business» more  BIS 2008»
15 years 4 months ago
Structural Detection of Deadlocks in Business Process Models
Abstract. A common task in business process modelling is the verification of process models regarding syntactical and structural errors. While the former might be checked with low ...
Ahmed Awad, Frank Puhlmann
145
Voted
CICLING
2009
Springer
15 years 10 months ago
The Value of Weights in Automatically Generated Text Structures
Abstract. One question that arises if we want to evolve generation techniques to accommodate Web ontologies is how to capture and expose the relevant ontology content to the user. ...
Dana Dannélls