Sciweavers

3378 search results - page 186 / 676
» Learning in Friedberg Numberings
Sort
View
COMBINATORICA
2010
15 years 1 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
TSP
2011
230views more  TSP 2011»
15 years 1 months ago
Bayesian Nonparametric Inference of Switching Dynamic Linear Models
—Many complex dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switc...
Emily B. Fox, Erik B. Sudderth, Michael I. Jordan,...
IJSNET
2010
317views more  IJSNET 2010»
15 years 1 months ago
MRL-CC: a novel cooperative communication protocol for QoS provisioning in wireless sensor networks
: Cooperative communications have been demonstrated to be effective in combating the multiple fading effects in wireless networks, and improving the network performance in terms of...
Xuedong Liang, Min Chen, Yang Xiao, Ilangko Balasi...
INTERSPEECH
2010
15 years 1 months ago
Deep-structured hidden conditional random fields for phonetic recognition
We extend our earlier work on deep-structured conditional random field (DCRF) and develop deep-structured hidden conditional random field (DHCRF). We investigate the use of this n...
Dong Yu, Li Deng
JMLR
2010
124views more  JMLR 2010»
15 years 1 months ago
Multiclass-Multilabel Classification with More Classes than Examples
We discuss multiclass-multilabel classification problems in which the set of classes is extremely large. Most existing multiclass-multilabel learning algorithms expect to observe ...
Ofer Dekel, Ohad Shamir