Sciweavers

1191 search results - page 50 / 239
» A new approach to nonrepetitive sequences
Sort
View
EOR
2008
75views more  EOR 2008»
15 years 6 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
BMCBI
2002
131views more  BMCBI 2002»
15 years 6 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
CVPR
2005
IEEE
16 years 8 months ago
Modelling Dynamic Scenes by Registering Multi-View Image Sequences
In this paper, we present a new variational method for multi-view stereovision and non-rigid three-dimensional motion estimation from multiple video sequences. Our method minimize...
Jean-Philippe Pons, Renaud Keriven, Olivier D. Fau...
CPM
2007
Springer
99views Combinatorics» more  CPM 2007»
16 years 10 days ago
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the applicatio...
Shay Mozes, Oren Weimann, Michal Ziv-Ukelson
CIKM
2004
Springer
15 years 11 months ago
Scalable sequential pattern mining for biological sequences
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...
Ke Wang, Yabo Xu, Jeffrey Xu Yu