Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Joel Ratsaby
@article{DBLP:journals/iandc/Ratsaby23,
author = {Joel Ratsaby},
title = {Learning half-spaces on general infinite spaces equipped with a distance
function},
journal = {Inf. Comput.},
volume = {291},
pages = {105008},
year = {2023},
url = {https://doi.org/10.1016/j.ic.2023.105008},
doi = {10.1016/J.IC.2023.105008},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/Ratsaby23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpads/RatsabyT23,
author = {Joel Ratsaby and
Alexander Timashkov},
title = {Accelerating the LZ-complexity algorithm},
booktitle = {29th {IEEE} International Conference on Parallel and Distributed Systems,
{ICPADS} 2023, Ocean Flower Island, China, December 17-21, 2023},
pages = {200--207},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ICPADS60453.2023.00038},
doi = {10.1109/ICPADS60453.2023.00038},
timestamp = {Sun, 14 Apr 2024 20:48:59 +0200},
biburl = {https://dblp.org/rec/conf/icpads/RatsabyT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pai/AnthonyR20,
author = {Martin Anthony and
Joel Ratsaby},
title = {Large-width machine learning algorithm},
journal = {Prog. Artif. Intell.},
volume = {9},
number = {3},
pages = {275--285},
year = {2020},
url = {https://doi.org/10.1007/s13748-020-00212-4},
doi = {10.1007/S13748-020-00212-4},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pai/AnthonyR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AnthonyR18,
author = {Martin Anthony and
Joel Ratsaby},
title = {Large-width bounds for learning half-spaces on distance spaces},
journal = {Discret. Appl. Math.},
volume = {243},
pages = {73--89},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.02.004},
doi = {10.1016/J.DAM.2018.02.004},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AnthonyR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AnthonyR18,
author = {Martin Anthony and
Joel Ratsaby},
title = {Large width nearest prototype classification on general distance spaces},
journal = {Theor. Comput. Sci.},
volume = {738},
pages = {65--79},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.04.045},
doi = {10.1016/J.TCS.2018.04.045},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AnthonyR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/Ratsaby18,
author = {Joel Ratsaby},
editor = {Amos J. Storkey and
Fernando P{\'{e}}rez{-}Cruz},
title = {On how complexity affects the stability of a predictor},
booktitle = {International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2018, 9-11 April 2018, Playa Blanca, Lanzarote, Canary Islands,
Spain},
series = {Proceedings of Machine Learning Research},
volume = {84},
pages = {161--167},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v84/ratsaby18a.html},
timestamp = {Wed, 03 Apr 2019 18:17:22 +0200},
biburl = {https://dblp.org/rec/conf/aistats/Ratsaby18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AnthonyR17,
author = {Martin Anthony and
Joel Ratsaby},
title = {Classification based on prototypes with spheres of influence},
journal = {Inf. Comput.},
volume = {256},
pages = {372--380},
year = {2017},
url = {https://doi.org/10.1016/j.ic.2017.08.004},
doi = {10.1016/J.IC.2017.08.004},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/AnthonyR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AnthonyR16,
author = {Martin Anthony and
Joel Ratsaby},
title = {Multi-category classifiers and sample width},
journal = {J. Comput. Syst. Sci.},
volume = {82},
number = {8},
pages = {1223--1231},
year = {2016},
url = {https://doi.org/10.1016/j.jcss.2016.04.003},
doi = {10.1016/J.JCSS.2016.04.003},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/AnthonyR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Ratsaby16,
author = {Joel Ratsaby},
title = {{PAC} Learning},
booktitle = {Encyclopedia of Algorithms},
pages = {1497--1500},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_276},
doi = {10.1007/978-1-4939-2864-4\_276},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Ratsaby16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AnthonyR15,
author = {Martin Anthony and
Joel Ratsaby},
title = {A probabilistic approach to case-based inference},
journal = {Theor. Comput. Sci.},
volume = {589},
pages = {61--75},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.04.016},
doi = {10.1016/J.TCS.2015.04.016},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AnthonyR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ida/BelousovR15,
author = {Alexander Belousov and
Joel Ratsaby},
editor = {{\'{E}}lisa Fromont and
Tijl De Bie and
Matthijs van Leeuwen},
title = {A Parallel Distributed Processing Algorithm for Image Feature Extraction},
booktitle = {Advances in Intelligent Data Analysis {XIV} - 14th International Symposium,
{IDA} 2015, Saint Etienne, France, October 22-24, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9385},
pages = {61--71},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-24465-5\_6},
doi = {10.1007/978-3-319-24465-5\_6},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/ida/BelousovR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/Ratsaby15,
author = {Joel Ratsaby},
title = {On complexity and randomness of Markov-chain prediction},
booktitle = {2015 {IEEE} Information Theory Workshop, {ITW} 2015, Jerusalem, Israel,
April 26 - May 1, 2015},
pages = {1--5},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ITW.2015.7133078},
doi = {10.1109/ITW.2015.7133078},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/itw/Ratsaby15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AnthonyR14,
author = {Martin Anthony and
Joel Ratsaby},
title = {A hybrid classifier based on boxes and nearest neighbors},
journal = {Discret. Appl. Math.},
volume = {172},
pages = {1--11},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.02.018},
doi = {10.1016/J.DAM.2014.02.018},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AnthonyR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AnthonyR14,
author = {Martin Anthony and
Joel Ratsaby},
title = {Learning bounds via sample width for classifiers on finite metric
spaces},
journal = {Theor. Comput. Sci.},
volume = {529},
pages = {2--10},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.07.004},
doi = {10.1016/J.TCS.2013.07.004},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AnthonyR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icaisc/KovacsR14,
author = {L{\'{a}}szl{\'{o}} Kov{\'{a}}cs and
Joel Ratsaby},
editor = {Leszek Rutkowski and
Marcin Korytkowski and
Rafal Scherer and
Ryszard Tadeusiewicz and
Lotfi A. Zadeh and
Jacek M. Zurada},
title = {A New Pseudo-metric for Fuzzy Sets},
booktitle = {Artificial Intelligence and Soft Computing - 13th International Conference,
{ICAISC} 2014, Zakopane, Poland, June 1-5, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8467},
pages = {205--216},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07173-2\_19},
doi = {10.1007/978-3-319-07173-2\_19},
timestamp = {Mon, 05 Feb 2024 20:31:53 +0100},
biburl = {https://dblp.org/rec/conf/icaisc/KovacsR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/foci/AnthonyR13,
author = {Martin Anthony and
Joel Ratsaby},
title = {Quantifying accuracy of learning via sample width},
booktitle = {{IEEE} Symposium on Foundations of Computational Intelligence, {FOCI}
2013, Singapore, Singapore, April 16-19, 2013},
pages = {84--90},
publisher = {{IEEE}},
year = {2013},
url = {https://doi.org/10.1109/FOCI.2013.6602459},
doi = {10.1109/FOCI.2013.6602459},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/foci/AnthonyR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sisap/ChesterR13,
author = {Uzi Chester and
Joel Ratsaby},
editor = {Nieves R. Brisaboa and
Oscar Pedreira and
Pavel Zezula},
title = {Machine Learning for Image Classification and Clustering Using a Universal
Distance Measure},
booktitle = {Similarity Search and Applications - 6th International Conference,
{SISAP} 2013, {A} Coru{\~{n}}a, Spain, October 2-4, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8199},
pages = {59--72},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41062-8\_7},
doi = {10.1007/978-3-642-41062-8\_7},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/sisap/ChesterR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ukci/AnthonyR13,
author = {Martin Anthony and
Joel Ratsaby},
title = {Maximal-margin case-based inference},
booktitle = {13th {UK} Workshop on Computational Intelligence, {UKCI} 2013, Guildford,
United Kingdom, September 9-11, 2013},
pages = {112--119},
publisher = {{IEEE}},
year = {2013},
url = {https://doi.org/10.1109/UKCI.2013.6651295},
doi = {10.1109/UKCI.2013.6651295},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ukci/AnthonyR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-4204,
author = {Uzi Chester and
Joel Ratsaby},
title = {Machine learning on images using a string-distance},
journal = {CoRR},
volume = {abs/1305.4204},
year = {2013},
url = {http://arxiv.org/abs/1305.4204},
eprinttype = {arXiv},
eprint = {1305.4204},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-4204.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AnthonyR12,
author = {Martin Anthony and
Joel Ratsaby},
title = {Robust cutpoints in the logical analysis of numerical data},
journal = {Discret. Appl. Math.},
volume = {160},
number = {4-5},
pages = {355--364},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.07.014},
doi = {10.1016/J.DAM.2011.07.014},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AnthonyR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AnthonyR12a,
author = {Martin Anthony and
Joel Ratsaby},
title = {Analysis of a multi-category classifier},
journal = {Discret. Appl. Math.},
volume = {160},
number = {16-17},
pages = {2329--2338},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.07.010},
doi = {10.1016/J.DAM.2012.07.010},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AnthonyR12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaim/AnthonyR12,
author = {Martin Anthony and
Joel Ratsaby},
title = {The performance of a new hybrid classifier based on boxes and nearest
neighbors},
booktitle = {International Symposium on Artificial Intelligence and Mathematics,
{ISAIM} 2012, Fort Lauderdale, Florida, USA, January 9-11, 2012},
year = {2012},
url = {http://www.cs.uic.edu/pub/Isaim2012/WebPreferences/ISAIM2012\_Boolean\_Anthony\_Ratsaby.pdf},
timestamp = {Wed, 20 Mar 2024 17:48:48 +0100},
biburl = {https://dblp.org/rec/conf/isaim/AnthonyR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mcm/Ratsaby11,
author = {Joel Ratsaby},
title = {On the sysRatio and its critical point},
journal = {Math. Comput. Model.},
volume = {53},
number = {5-6},
pages = {939--944},
year = {2011},
url = {https://doi.org/10.1016/j.mcm.2010.11.001},
doi = {10.1016/J.MCM.2010.11.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mcm/Ratsaby11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jossac/RatsabyC10,
author = {Joel Ratsaby and
Jo{\"{e}}l Chaskalovic},
title = {On the algorithmic complexity of static structures},
journal = {J. Syst. Sci. Complex.},
volume = {23},
number = {6},
pages = {1037--1053},
year = {2010},
url = {https://doi.org/10.1007/s11424-010-8465-2},
doi = {10.1007/S11424-010-8465-2},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jossac/RatsabyC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AnthonyR10,
author = {Martin Anthony and
Joel Ratsaby},
title = {Maximal width learning of binary functions},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {1},
pages = {138--147},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2009.09.020},
doi = {10.1016/J.TCS.2009.09.020},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AnthonyR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-5078,
author = {Joel Ratsaby},
title = {Prediction by Compression},
journal = {CoRR},
volume = {abs/1008.5078},
year = {2010},
url = {http://arxiv.org/abs/1008.5078},
eprinttype = {arXiv},
eprint = {1008.5078},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-5078.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-3410,
author = {L{\'{a}}szl{\'{o}} Kov{\'{a}}cs and
Joel Ratsaby},
title = {Descriptive-complexity based distance for fuzzy sets},
journal = {CoRR},
volume = {abs/1012.3410},
year = {2010},
url = {http://arxiv.org/abs/1012.3410},
eprinttype = {arXiv},
eprint = {1012.3410},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-3410.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0903-3667,
author = {Joel Ratsaby},
title = {How random are a learner's mistakes?},
journal = {CoRR},
volume = {abs/0903.3667},
year = {2009},
url = {http://arxiv.org/abs/0903.3667},
eprinttype = {arXiv},
eprint = {0903.3667},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0903-3667.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0905-2386,
author = {Joel Ratsaby},
title = {Combinatorial information distance},
journal = {CoRR},
volume = {abs/0905.2386},
year = {2009},
url = {http://arxiv.org/abs/0905.2386},
eprinttype = {arXiv},
eprint = {0905.2386},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0905-2386.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0908-4494,
author = {Joel Ratsaby},
title = {Learning, complexity and information density},
journal = {CoRR},
volume = {abs/0908.4494},
year = {2009},
url = {http://arxiv.org/abs/0908.4494},
eprinttype = {arXiv},
eprint = {0908.4494},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0908-4494.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-3648,
author = {Joel Ratsaby},
title = {Random scattering of bits by prediction},
journal = {CoRR},
volume = {abs/0909.3648},
year = {2009},
url = {http://arxiv.org/abs/0909.3648},
eprinttype = {arXiv},
eprint = {0909.3648},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0909-3648.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/Ratsaby08,
author = {Joel Ratsaby},
title = {On the complexity of binary samples},
journal = {Ann. Math. Artif. Intell.},
volume = {52},
number = {1},
pages = {55--65},
year = {2008},
url = {https://doi.org/10.1007/s10472-008-9096-3},
doi = {10.1007/S10472-008-9096-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/Ratsaby08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Ratsaby08,
author = {Joel Ratsaby},
title = {On the complexity of constrained VC-classes},
journal = {Discret. Appl. Math.},
volume = {156},
number = {6},
pages = {903--910},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.05.041},
doi = {10.1016/J.DAM.2007.05.041},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Ratsaby08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Ratsaby08a,
author = {Joel Ratsaby},
title = {Constrained versions of Sauer's lemma},
journal = {Discret. Appl. Math.},
volume = {156},
number = {14},
pages = {2753--2767},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.11.017},
doi = {10.1016/J.DAM.2007.11.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Ratsaby08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/YcartR08,
author = {Bernard Ycart and
Joel Ratsaby},
title = {VC-Dimensions of Random Function Classes},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {10},
number = {1},
year = {2008},
url = {https://doi.org/10.46298/dmtcs.448},
doi = {10.46298/DMTCS.448},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/YcartR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/entropy/Ratsaby08,
author = {Joel Ratsaby},
title = {An Algorithmic Complexity Interpretation of Lin's Third Law of Information
Theory},
journal = {Entropy},
volume = {10},
number = {1},
pages = {6--14},
year = {2008},
url = {https://doi.org/10.3390/entropy-e10010006},
doi = {10.3390/ENTROPY-E10010006},
timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/entropy/Ratsaby08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Ratsaby08,
author = {Joel Ratsaby},
editor = {Ming{-}Yang Kao},
title = {{PAC} Learning},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_276},
doi = {10.1007/978-0-387-30162-4\_276},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Ratsaby08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0801-4790,
author = {Joel Ratsaby},
title = {Information Width},
journal = {CoRR},
volume = {abs/0801.4790},
year = {2008},
url = {http://arxiv.org/abs/0801.4790},
eprinttype = {arXiv},
eprint = {0801.4790},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0801-4790.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0801-4794,
author = {Joel Ratsaby},
title = {On the Complexity of Binary Samples},
journal = {CoRR},
volume = {abs/0801.4794},
year = {2008},
url = {http://arxiv.org/abs/0801.4794},
eprinttype = {arXiv},
eprint = {0801.4794},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0801-4794.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-4089,
author = {Joel Ratsaby},
title = {An algorithmic complexity interpretation of Lin's third law of information
theory},
journal = {CoRR},
volume = {abs/0802.4089},
year = {2008},
url = {http://arxiv.org/abs/0802.4089},
eprinttype = {arXiv},
eprint = {0802.4089},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-4089.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-0623,
author = {Joel Ratsaby and
Jo{\"{e}}l Chaskalovic},
title = {Algorithmic complexity and randomness in elastic solids},
journal = {CoRR},
volume = {abs/0811.0623},
year = {2008},
url = {http://arxiv.org/abs/0811.0623},
eprinttype = {arXiv},
eprint = {0811.0623},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-0623.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/YcartR07,
author = {Bernard Ycart and
Joel Ratsaby},
title = {The {VC} dimension of k-uniform random hypergraphs},
journal = {Random Struct. Algorithms},
volume = {30},
number = {4},
pages = {564--572},
year = {2007},
url = {https://doi.org/10.1002/rsa.20142},
doi = {10.1002/RSA.20142},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/YcartR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/Ratsaby07,
author = {Joel Ratsaby},
editor = {Jan van Leeuwen and
Giuseppe F. Italiano and
Wiebe van der Hoek and
Christoph Meinel and
Harald Sack and
Frantisek Pl{\'{a}}sil},
title = {Information Efficiency},
booktitle = {{SOFSEM} 2007: Theory and Practice of Computer Science, 33rd Conference
on Current Trends in Theory and Practice of Computer Science, Harrachov,
Czech Republic, January 20-26, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4362},
pages = {475--487},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-69507-3\_41},
doi = {10.1007/978-3-540-69507-3\_41},
timestamp = {Fri, 21 Oct 2022 16:47:28 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/Ratsaby07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ratsaby06,
author = {Joel Ratsaby},
title = {Complexity of hyperconcepts},
journal = {Theor. Comput. Sci.},
volume = {363},
number = {1},
pages = {2--10},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.06.013},
doi = {10.1016/J.TCS.2006.06.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ratsaby06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/Ratsaby06,
author = {Joel Ratsaby},
editor = {Danny Z. Chen and
D. T. Lee},
title = {On the Combinatorial Representation of Information},
booktitle = {Computing and Combinatorics, 12th Annual International Conference,
{COCOON} 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4112},
pages = {479--488},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11809678\_50},
doi = {10.1007/11809678\_50},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/Ratsaby06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/Ratsaby04,
author = {Joel Ratsaby},
editor = {Kyung{-}Yong Chwa and
J. Ian Munro},
title = {On the Complexity of Samples for Learning},
booktitle = {Computing and Combinatorics, 10th Annual International Conference,
{COCOON} 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3106},
pages = {198--209},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27798-9\_23},
doi = {10.1007/978-3-540-27798-9\_23},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/Ratsaby04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Ratsaby03,
author = {Joel Ratsaby},
title = {On learning multicategory classification with sample queries},
journal = {Inf. Comput.},
volume = {185},
number = {2},
pages = {298--327},
year = {2003},
url = {https://doi.org/10.1016/S0890-5401(03)00083-X},
doi = {10.1016/S0890-5401(03)00083-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Ratsaby03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/Ratsaby03,
author = {Joel Ratsaby},
editor = {Ricard Gavald{\`{a}} and
Klaus P. Jantke and
Eiji Takimoto},
title = {A Stochastic Gradient Descent Algorithm for Structural Risk Minimisation},
booktitle = {Algorithmic Learning Theory, 14th International Conference, {ALT}
2003, Sapporo, Japan, October 17-19, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2842},
pages = {205--220},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39624-6\_17},
doi = {10.1007/978-3-540-39624-6\_17},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/Ratsaby03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscas/RatsabyV00,
author = {Joel Ratsaby and
Santosh S. Venkatesh},
title = {On partially blind learning complexity},
booktitle = {{IEEE} International Symposium on Circuits and Systems, {ISCAS} 2000,
Emerging Technologies for the 21st Century, Geneva, Switzerland, 28-31
May 2000, Proceedings},
pages = {765--768},
publisher = {{IEEE}},
year = {2000},
url = {https://doi.org/10.1109/ISCAS.2000.856441},
doi = {10.1109/ISCAS.2000.856441},
timestamp = {Fri, 13 Aug 2021 09:26:01 +0200},
biburl = {https://dblp.org/rec/conf/iscas/RatsabyV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/RatsabyM99,
author = {Joel Ratsaby and
Vitaly Maiorov},
title = {On the Learnability of Rich Function Classes},
journal = {J. Comput. Syst. Sci.},
volume = {58},
number = {1},
pages = {183--192},
year = {1999},
url = {https://doi.org/10.1006/jcss.1998.1604},
doi = {10.1006/JCSS.1998.1604},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/RatsabyM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MaiorovR98,
author = {Vitaly Maiorov and
Joel Ratsaby},
title = {The Degree of Approximation of Sets in Euclidean Space Using Sets
with Bounded Vapnik-Chervonenkis Dimension},
journal = {Discret. Appl. Math.},
volume = {86},
number = {1},
pages = {81--93},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(98)00015-8},
doi = {10.1016/S0166-218X(98)00015-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MaiorovR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pami/Ratsaby98,
author = {Joel Ratsaby},
title = {Incremental Learning With Sample Queries},
journal = {{IEEE} Trans. Pattern Anal. Mach. Intell.},
volume = {20},
number = {8},
pages = {883--888},
year = {1998},
url = {https://doi.org/10.1109/34.709619},
doi = {10.1109/34.709619},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pami/Ratsaby98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/RatsabyM97,
author = {Joel Ratsaby and
Vitaly Maiorov},
title = {On the Value of Partial Information for Learning from Examples},
journal = {J. Complex.},
volume = {13},
number = {4},
pages = {509--543},
year = {1997},
url = {https://doi.org/10.1006/jcom.1997.0459},
doi = {10.1006/JCOM.1997.0459},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/RatsabyM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocolt/RatsabyM97,
author = {Joel Ratsaby and
Vitaly Maiorov},
editor = {Shai Ben{-}David},
title = {Generalization of the PAC-Model for Learning with Partial Information},
booktitle = {Computational Learning Theory, Third European Conference, EuroCOLT
'97, Jerusalem, Israel, March 17-19, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1208},
pages = {51--65},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62685-9\_6},
doi = {10.1007/3-540-62685-9\_6},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/eurocolt/RatsabyM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/Ratsaby97,
author = {Joel Ratsaby},
editor = {Michael I. Jordan and
Michael J. Kearns and
Sara A. Solla},
title = {An Incremental Nearest Neighbor Algorithm with Queries},
booktitle = {Advances in Neural Information Processing Systems 10, {[NIPS} Conference,
Denver, Colorado, USA, 1997]},
pages = {612--618},
publisher = {The {MIT} Press},
year = {1997},
url = {http://papers.nips.cc/paper/1418-an-incremental-nearest-neighbor-algorithm-with-queries},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/Ratsaby97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/RatsabyMM96,
author = {Joel Ratsaby and
Ron Meir and
Vitaly Maiorov},
editor = {Avrim Blum and
Michael J. Kearns},
title = {Towards Robust Model Selection Using Estimation and Approximation
Error Bounds},
booktitle = {Proceedings of the Ninth Annual Conference on Computational Learning
Theory, {COLT} 1996, Desenzano del Garda, Italy, June 28-July 1, 1996},
pages = {57--67},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/238061.238069},
doi = {10.1145/238061.238069},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/RatsabyMM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/RatsabyV95,
author = {Joel Ratsaby and
Santosh S. Venkatesh},
editor = {Wolfgang Maass},
title = {Learning from a Mixture of Labeled and Unlabeled Examples with Parametric
Side Information},
booktitle = {Proceedings of the Eigth Annual Conference on Computational Learning
Theory, {COLT} 1995, Santa Cruz, California, USA, July 5-8, 1995},
pages = {412--417},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225298.225348},
doi = {10.1145/225298.225348},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/RatsabyV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
