Sciweavers

2239 search results - page 54 / 448
» Computing with abstract matrix structures
Sort
View
IANDC
2008
114views more  IANDC 2008»
14 years 12 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
AMC
2007
90views more  AMC 2007»
14 years 12 months ago
Computing the square roots of matrices with central symmetry
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
Zhongyun Liu, Yulin Zhang, Rui Ralha
ICTAI
2006
IEEE
15 years 5 months ago
Computing the Equilibria of Bimatrix Games Using Dominance Heuristics
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
Raghav Aras, Alain Dutech, François Charpil...
ISI
2004
Springer
15 years 5 months ago
Studying E-Mail Graphs for Intelligence Monitoring and Analysis in the Absence of Semantic Information
Abstract. This work describes a methodology that can be used to identify structure and communication patterns within an organization based on e-mail data. The first step of the me...
Petros Drineas, Mukkai S. Krishnamoorthy, Michael ...
ADG
2006
Springer
177views Mathematics» more  ADG 2006»
15 years 5 months ago
Recognition of Computationally Constructed Loci
Abstract. We propose an algorithm for automated recognition of computationally constructed curves and discuss several aspects of the recognition problem. Recognizing loci means det...
Peter Lebmeir, Jürgen Richter-Gebert