Sciweavers

2239 search results - page 72 / 448
» Computing with abstract matrix structures
Sort
View
SP
2008
IEEE
115views Security Privacy» more  SP 2008»
14 years 11 months ago
Complexity in scalable computing
f abstraction (hardware) to the highest (people). This issue's theme encompasses this entire spectrum. The lead author of each article resides in the Scalable Computing Resear...
Damian W. I. Rouson
PAMI
2007
129views more  PAMI 2007»
14 years 11 months ago
Algorithmic Differentiation: Application to Variational Problems in Computer Vision
Abstract— Many vision problems can be formulated as minimization of appropriate energy functionals. These energy functionals are usually minimized, based on the calculus of varia...
Thomas Pock, Michael Pock, Horst Bischof
SIGMETRICS
2000
ACM
105views Hardware» more  SIGMETRICS 2000»
15 years 4 months ago
Using the exact state space of a Markov model to compute approximate stationary measures
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
Andrew S. Miner, Gianfranco Ciardo, Susanna Donate...
SAGT
2009
Springer
131views Game Theory» more  SAGT 2009»
15 years 6 months ago
The Computational Complexity of Weak Saddles
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
Felix Brandt, Markus Brill, Felix A. Fischer, Jan ...
APN
2004
Springer
15 years 5 months ago
Time Petri Nets with Inhibitor Hyperarcs. Formal Semantics and State Space Computation
Abstract. In this paper, we define Time Petri Nets with Inhibitor Hyperarcs (IHTPN) as an extension of T-time Petri nets where time is associated with transitions. In this model, ...
Olivier H. Roux, Didier Lime