Sciweavers

3204 search results - page 353 / 641
» Online Learning with Constraints
Sort
View
JMLR
2010
119views more  JMLR 2010»
15 years 1 months ago
Semi-Supervised Learning via Generalized Maximum Entropy
Various supervised inference methods can be analyzed as convex duals of the generalized maximum entropy (MaxEnt) framework. Generalized MaxEnt aims to find a distribution that max...
Ayse Erkan, Yasemin Altun
IJON
2011
90views more  IJON 2011»
14 years 10 months ago
Fault tolerant machine learning for nanoscale cognitive radio
We introduce a machine learning based classifier that identifies free radio channels for cognitive radio. The architecture is designed for nanoscale implementation, under nanosc...
Joni Pajarinen, Jaakko Peltonen, Mikko A. Uusitalo
ICML
2008
IEEE
16 years 7 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
AR
2002
113views more  AR 2002»
15 years 6 months ago
Final-state control of a two-link cat robot
: This paper deals with twisting motion of a falling cat robot by two torque inputs around her waist. The cat robot consists of two rigid columns and has internally two actuators a...
Zhiqiang Weng, Hidekazu Nishimura
IJCNN
2006
IEEE
16 years 22 days ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang