Sciweavers

1197 search results - page 101 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
ICASSP
2011
IEEE
13 years 2 days ago
Variational Bayesian Kalman filtering in dynamical tomography
The problem of dynamical tomography consists in reconstructing a temporal sequence of images from their noisy projections. For this purpose, a recursive algorithm is usually used,...
Boujemaa Ait-El-Fquih, Thomas Rodet
ICPR
2006
IEEE
14 years 9 months ago
Recover Writing Trajectory from Multiple Stroked Image Using Bidirectional Dynamic Search
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...
Yu Qiao, Makoto Yasuhara
AIPS
2006
13 years 9 months ago
Tractable Optimal Competitive Scheduling
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
Jeremy Frank, James Crawford, Lina Khatib, Ronen I...
ICRA
2009
IEEE
141views Robotics» more  ICRA 2009»
14 years 3 months ago
Detecting repeated motion patterns via Dynamic Programming using motion density
— In this paper, we propose a method that detects repeated motion patterns in a long motion sequence efficiently. Repeated motion patterns are the structured information that ca...
Koichi Ogawara, Yasufumi Tanabe, Ryo Kurazume, Tsu...
ICCAD
2002
IEEE
149views Hardware» more  ICCAD 2002»
14 years 5 months ago
Battery-aware power management based on Markovian decision processes
- This paper addresses the problem of maximizing capacity utilization of the battery power source in a portable electronic system under latency and loss rate constraints. First, a ...
Peng Rong, Massoud Pedram