Sciweavers

1136 search results - page 78 / 228
» Learning with Weighted Transducers
Sort
View
WWW
2008
ACM
16 years 3 months ago
A graph-theoretic approach to webpage segmentation
We consider the problem of segmenting a webpage into visually and semantically cohesive pieces. Our approach is based on formulating an appropriate optimization problem on weighte...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
COLT
2006
Springer
15 years 5 months ago
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
Manfred K. Warmuth
TCSV
2008
175views more  TCSV 2008»
15 years 3 months ago
Expandable Data-Driven Graphical Modeling of Human Actions Based on Salient Postures
This paper presents a graphical model for learning and recognizing human actions. Specifically, we propose to encode actions in a weighted directed graph, referred to as action gra...
Wanqing Li, Zhengyou Zhang, Zicheng Liu
ESANN
2006
15 years 4 months ago
Learning and discrimination through STDP in a top-down modulated associative memory
Abstract. This article underlines the learning and discrimination capabilities of a model of associative memory based on artificial networks of spiking neurons. Inspired from neuro...
Anthony Mouraud, Hélène Paugam-Moisy
NIPS
2004
15 years 4 months ago
Semi-supervised Learning by Entropy Minimization
We consider the semi-supervised learning problem, where a decision rule is to be learned from labeled and unlabeled data. In this framework, we motivate minimum entropy regulariza...
Yves Grandvalet, Yoshua Bengio