1.7k citations
- Technion – Israel Institute of TechnologyIL151 papers
- Oranim Academic College of EducationIL134 papers
- Tel Aviv UniversityIL55 papers
- Heidelberg UniversityDE36 papers
- Carmel (Israel)IL29 papers
- Columbia UniversityUS25 papers
- Massachusetts Institute of TechnologyUS25 papers
- National Research University Higher School of EconomicsRU25 papers
- University of AmsterdamNL22 papers
- Hebrew University of JerusalemIL21 papers
- Princeton UniversityUS21 papers
- Centre National de la Recherche ScientifiqueFR20 papers
Showing 2018 · cs.DSShow all
2 papers · 2 filters
cs.DS2018
A new lower bound for classic online bin packing
János Balogh, József Békési, György Dósa +2
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packing to above 1.54278. We demonstrate for the first time the advantage of branchin…
cs.DS2018
Secure -ish Nearest Neighbors Classifier
Hayim Shaul, Dan Feldman, Daniela Rus
In machine learning, classifiers are used to predict a class of a given query based on an existing (classified) database. Given a database S of n d-dimensional points and a d-dimen…