Sciweavers

324 search results - page 19 / 65
» Guessing based on length functions
Sort
View
TIT
2002
95views more  TIT 2002»
13 years 7 months ago
On sequential strategies for loss functions with memory
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Mar...
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...
ARSCOM
2005
92views more  ARSCOM 2005»
13 years 7 months ago
Binary Strings Without Odd Runs of Zeros
We look at binary strings of length n which contain no odd run of zeros and express the total number of such strings, the number of zeros, the number of ones, the total number of ...
Ralph Grimaldi, Silvia Heubach
CVPR
2005
IEEE
14 years 9 months ago
Level Set Based Shape Prior Segmentation
We propose a level set based variational approach that incorporates shape priors into Chan-Vese's model [3] for the shape prior segmentation problem. In our model, besides th...
Tony F. Chan, Wei Zhu
ISCAS
1994
IEEE
117views Hardware» more  ISCAS 1994»
13 years 11 months ago
Design of a Fast Sequential Decoding Algorithm Based on Dynamic Searching Strategy
This paper presents a new sequential decoding algorithm based on dynamic searching strategy to improve decoding efficiency. The searching strategy is to exploit both sorting and p...
Wen-Wei Yang, Li-Fu Jeng, Chen-Yi Lee