Sciweavers

2230 search results - page 31 / 446
» Reformulating Constraint Models Using Input Data
Sort
View
FUIN
2008
92views more  FUIN 2008»
14 years 9 months ago
Translation of Timed Promela to Timed Automata with Discrete Data
The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela, a timed extension of the language is presented. Next, timed Promela is transla...
Wojciech Nabialek, Agata Janowska, Pawel Janowski
ICML
2006
IEEE
15 years 10 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
CCR
2006
122views more  CCR 2006»
14 years 9 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
ICCV
2009
IEEE
14 years 7 months ago
Complex volume and pose tracking with probabilistic dynamical models and visual hull constraints
We propose a method for estimating the pose of a human body using its approximate 3D volume (visual hull) obtained in real time from synchronized videos. Our method can cope with ...
Norimichi Ukita, Michiro Hirai, Masatsugu Kidode
ICIP
1999
IEEE
15 years 11 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...