Sciweavers

3630 search results - page 142 / 726
» Fast Marching Methods
Sort
View
ICTAI
2010
IEEE
15 years 4 months ago
Combining Mixed Integer Programming and Supervised Learning for Fast Re-planning
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
Emmanuel Rachelson, Ala Ben Abbes, Sebastien Dieme...
QEST
2010
IEEE
15 years 4 months ago
Rare Event Simulation for Highly Dependable Systems with Fast Repairs
Stochastic model checking has been used recently to assess, among others, dependability measures for a variety of systems. However, the employed numerical methods, as, e.g., suppor...
Daniël Reijsbergen, Pieter-Tjerk de Boer, Wer...
ICIP
2009
IEEE
15 years 4 months ago
Fast subspace-based tensor data filtering
Subspace-based methods rely on dominant element selection from second order statistics. They have been extended to tensor processing, in particular to tensor data filtering. For t...
Julien Marot, Caroline Fossati, Salah Bourennane
ICIAR
2010
Springer
15 years 3 months ago
Image Segmentation for Robots: Fast Self-adapting Gaussian Mixture Model
Image segmentation is a critical low-level visual routine for robot perception. However, most image segmentation approaches are still too slow to allow real-time robot operation. I...
Nicola Greggio, Alexandre Bernardino, José ...
CORR
2011
Springer
198views Education» more  CORR 2011»
15 years 1 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski