Sciweavers

908 search results - page 125 / 182
» Stochastic Finite Learning
Sort
View
ICML
2010
IEEE
13 years 10 months ago
Robust Formulations for Handling Uncertainty in Kernel Matrices
We study the problem of uncertainty in the entries of the Kernel matrix, arising in SVM formulation. Using Chance Constraint Programming and a novel large deviation inequality we ...
Sahely Bhadra, Sourangshu Bhattacharya, Chiranjib ...
JMLR
2008
83views more  JMLR 2008»
13 years 9 months ago
Generalization from Observed to Unobserved Features by Clustering
We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attr...
Eyal Krupka, Naftali Tishby
NCA
2008
IEEE
13 years 9 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
ICML
2010
IEEE
13 years 7 months ago
The Margin Perceptron with Unlearning
We introduce into the classical Perceptron algorithm with margin a mechanism of unlearning which in the course of the regular update allows for a reduction of possible contributio...
Constantinos Panagiotakopoulos, Petroula Tsampouka
MASCOTS
2008
13 years 10 months ago
Network Information Flow in Network of Queues
Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multi-ho...
Phillipa Gill, Zongpeng Li, Anirban Mahanti, Jingx...