Sciweavers

2031 search results - page 55 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
GLOBECOM
2008
IEEE
15 years 8 months ago
Generalized Capacity and Source-Channel Coding for Packet Erasure Channels
— We study the transmission of a stationary ergodic Gaussian source over a packet erasure channel, which is a composite channel with degraded states. A broadcast channel code can...
Yifan Liang, Andrea J. Goldsmith, Michelle Effros
AIIA
2007
Springer
15 years 8 months ago
Structured Hidden Markov Model: A General Framework for Modeling Complex Sequences
Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact...
Ugo Galassi, Attilio Giordana, Lorenza Saitta
PRIMA
2009
Springer
15 years 8 months ago
Designing a Two-Sided Matching Protocol under Asymmetric Information
Abstract. We have developed a new two-sided matching protocol including job applicants and employers in the condition that applicants have conditional preferences and well informed...
Masanori Hatanaka, Shigeo Matsubara
ICCV
2007
IEEE
16 years 3 months ago
An Empirical Study of Object Category Recognition: Sequential Testing with Generalized Samples
In this paper we present an empirical study of object category recognition using generalized samples and a set of sequential tests. We study 33 categories, each consisting of a sm...
Liang Lin, Shaowu Peng, Jake Porway, Song Chun Zhu...
RECOMB
2002
Springer
16 years 2 months ago
Approximate matching of secondary structures
This talk presents an algorithm to search for all approximate matches of a helix in a genome, where a helix is a combination of sequence and folding constraints. It is a joint wor...
Nadia El-Mabrouk, Mathieu Raffinot