Sciweavers

1984 search results - page 328 / 397
» The colourful feasibility problem
Sort
View
JMLR
2010
136views more  JMLR 2010»
13 years 4 months ago
Reducing Label Complexity by Learning From Bags
We consider a supervised learning setting in which the main cost of learning is the number of training labels and one can obtain a single label for a bag of examples, indicating o...
Sivan Sabato, Nathan Srebro, Naftali Tishby
ML
2010
ACM
193views Machine Learning» more  ML 2010»
13 years 4 months ago
On the eigenvectors of p-Laplacian
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping N...
SIAMDM
2010
101views more  SIAMDM 2010»
13 years 4 months ago
Rationality and Strongly Polynomial Solvability of Eisenberg--Gale Markets with Two Agents
Inspired by the convex program of Eisenberg and Gale which captures Fisher markets with linear utilities, Jain and Vazirani [STOC, 2007] introduced the class of EisenbergGale (EG)...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
TC
2010
13 years 4 months ago
Generating Reliable Code from Hybrid-Systems Models
Hybrid systems have emerged as an appropriate formalism to model embedded systems as they capture the theme of continuous dynamics with discrete control. Under this paradigm, distr...
Madhukar Anand, Sebastian Fischmeister, Yerang Hur...
TCOS
2010
13 years 4 months ago
PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware
Abstract. In [24] Raddum and Semaev propose a technique to solve systems of polynomial equations over F2 as occurring in algebraic attacks on block ciphers. This approach is known ...
Willi Geiselmann, Kenneth Matheis, Rainer Steinwan...