Sciweavers

1366 search results - page 181 / 274
» Modularizing Contexted Constraints
Sort
View
SCP
2000
119views more  SCP 2000»
15 years 2 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen
IPPS
2010
IEEE
15 years 1 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
CASES
2011
ACM
14 years 3 months ago
Enabling parametric feasibility analysis in real-time calculus driven performance evaluation
This paper advocates a rigorously formal and compositional style for obtaining key performance and/or interface metrics of systems with real-time constraints. We propose a hierarc...
Alena Simalatsar, Yusi Ramadian, Kai Lampka, Simon...
ICCV
2007
IEEE
16 years 5 months ago
Optimization Algorithms for Labeling Brain Sulci Based on Graph Matching
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
Faguo Yang, Frithjof Kruggel
ECCV
2002
Springer
16 years 5 months ago
Dense Motion Analysis in Fluid Imagery
Analyzing fluid motion is essential in number of domains and can rarely be handled using generic computer vision techniques. In this particular application context, we address two ...
Thomas Corpetti, Étienne Mémin, Patr...