Sciweavers

8413 search results - page 243 / 1683
» Ordering Problem Subgoals
Sort
View
142
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Bayesian framework and message passing for joint support and signal recovery of approximately sparse signals
In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly spa...
Shubha Shedthikere, Ananthanarayanan Chockalingam
COMPSAC
2002
IEEE
15 years 5 months ago
Expanding an Extended Finite State Machine to aid Testability
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in o...
Robert M. Hierons, T.-H. Kim, Hasan Ural
91
Voted
TCS
2008
15 years 22 days ago
Multi-break rearrangements and chromosomal evolution
Most genome rearrangements (e.g., reversals and translocations) can be represented as 2-breaks that break a genome at 2 points and glue the resulting fragments in a new order. Mul...
Max A. Alekseyev, Pavel A. Pevzner
87
Voted
CORR
2008
Springer
87views Education» more  CORR 2008»
15 years 27 days ago
Two-Level Concept-Oriented Data Model
In this paper we describe a new approach to data modelling called the concept-oriented model (CoM). This model is based on the formalism of nested ordered sets which uses inclusion...
Alexandr A. Savinov
WADS
2009
Springer
298views Algorithms» more  WADS 2009»
15 years 7 months ago
A Comparison of Performance Measures for Online Algorithms
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
Joan Boyar, Sandy Irani, Kim S. Larsen