Sciweavers

2834 search results - page 87 / 567
» A Probabilistic Approach to Measuring Robustness in Computin...
Sort
View
BMCBI
2010
117views more  BMCBI 2010»
13 years 8 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski
IPSN
2007
Springer
14 years 2 months ago
Robust message-passing for statistical inference in sensor networks
Large-scale sensor network applications require in-network processing and data fusion to compute statistically relevant summaries of the sensed measurements. This paper studies di...
Jeremy Schiff, Dominic Antonelli, Alexandros G. Di...
ICCV
2003
IEEE
14 years 9 months ago
Fast Vehicle Detection with Probabilistic Feature Grouping and its Application to Vehicle Tracking
Generating vehicle trajectories from video data is an important application of ITS (Intelligent Transportation Systems). We introduce a new tracking approach which uses model-base...
Zu Whan Kim, Jitendra Malik
TSMC
2010
13 years 2 months ago
An Architecture for Adaptive Algorithmic Hybrids
We describe a cognitive architecture for creating more robust intelligent systems by executing hybrids of algorithms based on different computational formalisms. The architecture ...
Nicholas L. Cassimatis, Perrin G. Bignoli, Magdale...
BERTINORO
2005
Springer
14 years 1 months ago
On the Use of Online Analytic Performance Models, in Self-Managing and Self-Organizing Computer Systems
Current computing environments are becoming increasingly complex in nature and exhibit unpredictable workloads. These environments create challenges to the design of systems that c...
Daniel A. Menascé, Mohamed N. Bennani, Hong...