Sciweavers

21520 search results - page 59 / 4304
» Symmetric network computation
Sort
View
JMLR
2010
105views more  JMLR 2010»
14 years 4 months ago
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials
Many structured information extraction tasks employ collective graphical models that capture interinstance associativity by coupling them with various clique potentials. We propos...
Rahul Gupta, Sunita Sarawagi, Ajit A. Diwan
IPPS
2006
IEEE
15 years 4 months ago
Self-stabilizing distributed algorithms for graph alliances
Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorith...
Zhenyu Xu, Pradip K. Srimani
LSSC
1999
Springer
15 years 2 months ago
A Method for Solving Special Circulant Pentadiagonal Linear Systems
A new effective modification of the method which is described in [1] for solving of real symmetric circulant pentadiagonal systems of linear equations is proposed. We consider t...
Ivan G. Ivanov, Borislav V. Minchev
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
15 years 2 months ago
On Randomized Lanczos Algorithms
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algor...
Wayne Eberly, Erich Kaltofen
FCT
1995
Springer
15 years 1 months ago
Axiomatizing Petri Net Concatenable Processes
The concatenable processes of a Petri net N can be characterized ly as the arrows of a symmetric monoidal category P[N]. Yet, this is only a partial axiomatization, since P[N] is b...
Vladimiro Sassone