Sciweavers

433 search results - page 78 / 87
» Optimal Segmentation of Random Sequences
Sort
View
SIROCCO
2008
15 years 3 months ago
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
Abstract. Consider a system composed of n sensors operating in synchronous rounds. In each round an input vector of sensor readings x is produced, where the i-th entry of x is a bi...
Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Er...
ISMB
1996
15 years 3 months ago
A Knowledge-Based Method for Protein Structure Refinement and Prediction
The native conformation of a protein, in a given environment, is determined entirely by the various interatomic interactions dictated by the amino acid sequence (1-3). We describe...
Shankar Subramaniam, David K. Tcheng, James M. Fen...
TIT
2002
95views more  TIT 2002»
15 years 2 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...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 6 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
145
Voted
AI
2010
Springer
15 years 2 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...