Sciweavers

2356 search results - page 240 / 472
» Characterizations of postman sets
Sort
View
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 6 months ago
Learning from compressed observations
— The problem of statistical learning is to construct a predictor of a random variable Y as a function of a related random variable X on the basis of an i.i.d. training sample fr...
Maxim Raginsky
CORR
2007
Springer
101views Education» more  CORR 2007»
15 years 6 months ago
Variable-Rate Distributed Source Coding in the Presence of Byzantine Sensors
— The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown number of sensors have been reprogrammed by a...
Oliver Kosut, Lang Tong
141
Voted
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 6 months ago
Embedded Rank Distance Codes for ISI channels
Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time...
Sanket Dusad, Suhas N. Diggavi, A. Robert Calderba...
JMLR
2006
143views more  JMLR 2006»
15 years 6 months ago
Segmental Hidden Markov Models with Random Effects for Waveform Modeling
This paper proposes a general probabilistic framework for shape-based modeling and classification of waveform data. A segmental hidden Markov model (HMM) is used to characterize w...
Seyoung Kim, Padhraic Smyth
JSC
2006
56views more  JSC 2006»
15 years 6 months ago
Viterbi sequences and polytopes
A Viterbi path of length n of a discrete Markov chain is a sequence of n + 1 states that has the greatest probability of ocurring in the Markov chain. We divide the space of all M...
Eric H. Kuo