Sciweavers

1478 search results - page 30 / 296
» Modular Complexity Analysis via Relative Complexity
Sort
View
IANDC
2006
117views more  IANDC 2006»
13 years 7 months ago
A modular approach to defining and characterising notions of simulation
We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notio...
Corina Cîrstea
JACM
2010
116views more  JACM 2010»
13 years 6 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
13 years 11 months ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin
SIAMSC
2008
142views more  SIAMSC 2008»
13 years 6 months ago
Algebraic Multigrid Solvers for Complex-Valued Matrices
In the mathematical modeling of real-life applications, systems of equations with complex coefficients often arise. While many techniques of numerical linear algebra, e.g., Krylovs...
Scott MacLachlan, Cornelis W. Oosterlee
WEBI
2009
Springer
14 years 2 months ago
Revealing Hidden Community Structures and Identifying Bridges in Complex Networks: An Application to Analyzing Contents of Web P
The emergence of scale free and small world properties in real world complex networks has stimulated lots of activity in the field of network analysis. An example of such a netwo...
Faraz Zaidi, Arnaud Sallaberry, Guy Melanço...