Sciweavers

282 search results - page 23 / 57
» Additive Preconditioning for Matrix Computations
Sort
View
PE
2011
Springer
167views Optimization» more  PE 2011»
14 years 9 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...
133
Voted
SPAA
2004
ACM
15 years 7 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
SIGMETRICS
2000
ACM
105views Hardware» more  SIGMETRICS 2000»
15 years 6 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...
STOC
2007
ACM
169views Algorithms» more  STOC 2007»
16 years 2 months ago
Proportional response dynamics leads to market equilibrium
One of the main reasons of the recent success of peer to peer (P2P) file sharing systems such as BitTorrent is its built-in tit-for-tat mechanism. In this paper, we model the band...
Fang Wu, Li Zhang
CVIU
2006
110views more  CVIU 2006»
15 years 1 months ago
Matching actions in presence of camera motion
When the camera viewing an action is moving, the motion observed in the video not only contains the motion of the actor but also the motion of the camera. At each time instant, in...
Alper Yilmaz, Mubarak Shah