Sciweavers

2597 search results - page 160 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
WOB
2003
140views Bioinformatics» more  WOB 2003»
15 years 3 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....
DM
2007
87views more  DM 2007»
15 years 1 months ago
Gaps in samples of geometric random variables
In this note we continue the study of gaps in samples of geometric random variables originated in Hitczenko and Knopfmacher [Gap-free compositions and gap-free samples of geometri...
William M. Y. Goh, Pawel Hitczenko
CVPR
2010
IEEE
15 years 10 months ago
What's going on? Discovering Spatio-Temporal Dependencies in Dynamic Scenes
We present two novel methods to automatically learn spatio-temporal dependencies of moving agents in complex dynamic scenes. They allow to discover temporal rules, such as the rig...
Daniel Kuettel, Michael Breitenstein, Luc Van Gool...
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
15 years 8 months ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu
VTC
2007
IEEE
143views Communications» more  VTC 2007»
15 years 8 months ago
Ant-Colony-Based Multiuser Detection for MC DS-CDMA Systems
Abstract— In this contribution we present a novel ant colony optimization (ACO) based multi-user detector (MUD) designed for synchronous multi-carrier direct sequence code divisi...
Chong Xu, Lie-Liang Yang, Lajos Hanzo