Sciweavers

87 search results - page 8 / 18
» Combinatorial Complexity of Convex Sequences
Sort
View
BMCBI
2006
98views more  BMCBI 2006»
13 years 7 months ago
Scanning sequences after Gibbs sampling to find multiple occurrences of functional elements
Background: Many DNA regulatory elements occur as multiple instances within a target promoter. Gibbs sampling programs for finding DNA regulatory elements de novo can be prohibiti...
Kannan Tharakaraman, Leonardo Mariño-Ram&ia...
SETA
2004
Springer
79views Mathematics» more  SETA 2004»
14 years 25 days ago
A Survey of the Merit Factor Problem for Binary Sequences
A classical problem of digital sequence design, first studied in the 1950s but still not well understood, is to determine those binary sequences whose aperiodic autocorrelations ...
Jonathan Jedwab
TWC
2010
13 years 2 months ago
Optimized Training Sequences for Spatially Correlated MIMO-OFDM
In this paper, the training sequence design for multiple-input multiple-output (MIMO) orthogonal frequencydivision multiplexing (OFDM) systems under the minimum mean square error (...
Hoang Duong Tuan, Ha Hoang Kha, Ha H. Nguyen, Viet...
ECCV
2002
Springer
14 years 9 months ago
On the Motion and Appearance of Specularities in Image Sequences
Real scenes are full of specularities (highlights and reflections), and yet most vision algorithms ignore them. In order to capture the appearance of realistic scenes, we need to ...
Rahul Swaminathan, Sing Bing Kang, Richard Szelisk...
CCCG
2010
13 years 9 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
Xiuxia Pan, Fajie Li, Reinhard Klette