Sciweavers

2994 search results - page 380 / 599
» Time sequences
Sort
View
152
Voted
IWOCA
2010
Springer
219views Algorithms» more  IWOCA 2010»
14 years 10 months ago
Efficient Chaining of Seeds in Ordered Trees
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Julien Allali, Cedric Chauve, Pascal Ferraro, Anne...
153
Voted
TSMC
2010
14 years 10 months ago
A Mathematical Programming Solution to the Mars Express Memory Dumping Problem
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
Giovanni Righini, Emanuele Tresoldi
118
Voted
TWC
2010
14 years 10 months ago
A Reduced-Complexity PTS-Based PAPR Reduction Scheme for OFDM Systems
In this paper, a reduced-complexity partial transmit sequences (PTS) scheme is proposed to resolve the intrinsic high peak-to-average power ratio (PAPR) problem of orthogonal frequ...
Sheng-Ju Ku, Chin-Liang Wang, Chiuan-Hsu Chen
188
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Detecting moving objects from dynamic background with shadow removal
Background subtraction is commonly used to detect foreground objects in video surveillance. Traditional background subtraction methods are usually based on the assumption that the...
Shih-Chieh Wang, Te-Feng Su, Shang-Hong Lai
152
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Estimation and dynamic updating of time-varying signals with sparse variations
This paper presents an algorithm for an 1-regularized Kalman filter. Given observations of a discrete-time linear dynamical system with sparse errors in the state evolution, we e...
Muhammad Salman Asif, Adam Charles, Justin K. Romb...