168 search results - page 14 / 34 » An Upper Bound for B2[2] Sequences |
TSP
2010
13 years 2 months ago
2010
Abstract--In this paper, we present a concise and coherent analysis of the constrained `1 minimization method for stable recovering of high-dimensional sparse signals both in the n...
SIGDIAL
2010
13 years 5 months ago
2010
This paper proposes a novel approach for predicting user satisfaction transitions during a dialogue only from the ratings given to entire dialogues, with the aim of reducing the c...
DAGSTUHL
2004
13 years 9 months ago
2004
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
TII
2010
13 years 2 months ago
2010
Abstract--Real-time systems are subject to temporal constraints and require a schedulability analysis to ensure that task execution finishes within lower and upper specified bounds...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
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...