Zobrazeno 1 - 10
of 84
pro vyhledávání: '"Alon Itai"'
We consider the problem of learning uncertainty regions for parameter estimation problems. The regions are ellipsoids that minimize the average volumes subject to a prescribed coverage probability. As expected, under the assumption of jointly Gaussia
Externí odkaz:
http://arxiv.org/abs/2405.02441
Generative models have been successfully used for generating realistic signals. Because the likelihood function is typically intractable in most of these models, the common practice is to use "implicit" models that avoid likelihood calculation. Howev
Externí odkaz:
http://arxiv.org/abs/2110.13452
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 88:517-532
Acronyms—words formed from the initial letters of a phrase—are important for various natural language processing applications, including information retrieval and machine translation. While hand-crafted acronym dictionaries exist, they are limite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09583e1871ba157fde358c72bcee28ff
https://doi.org/10.1007/s10472-018-9608-8
https://doi.org/10.1007/s10472-018-9608-8
Publikováno v:
International Journal of Lexicography. 27:130-170
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb51a1964b550f1335c9a19a8de068da
https://doi.org/10.1093/ijl/ect036
https://doi.org/10.1093/ijl/ect036
Publikováno v:
Language Resources and Evaluation. 49:107-145
We present a syntactic parser of (transcripts of) spoken Hebrew: a dependency parser of the Hebrew CHILDES database. CHILDES is a corpus of child---adult linguistic interactions. Its Hebrew section has recently been morphologically analyzed and disam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f68f2af6a4d795e709a02f6e1432e6cb
https://doi.org/10.1007/s10579-013-9256-x
https://doi.org/10.1007/s10579-013-9256-x
Autor:
Alon Itai
Publikováno v:
Encyclopedia of Algorithms ISBN: 9783642278488
Encyclopedia of Algorithms
Encyclopedia of Algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b83feafe3851ab6aca102013860a22e
https://doi.org/10.1007/978-1-4939-2864-4_322
https://doi.org/10.1007/978-1-4939-2864-4_322
Autor:
Shuly Wintner, Alon Itai
Publikováno v:
Language Resources and Evaluation. 42:75-98
We describe a suite of standards, resources and tools for computational encoding and processing of Modern Hebrew texts. These include an array of XML schemas for representing linguistic resources; a variety of text corpora, raw, automatically process
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0f33c723b9b3781395e03ddcad472b3
https://doi.org/10.1007/s10579-007-9050-8
https://doi.org/10.1007/s10579-007-9050-8
Autor:
Irit Katriel, Alon Itai
Publikováno v:
Information Processing Letters. 104:200-204
The Sparse Table is a data structure for controlling density in an array which was first proposed in 1981 and has recently reappeared as a component of cache-oblivious data structures. All existing variants of the Sparse Table divide the array into b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da9d4f6439926354516733e14ef50016
https://doi.org/10.1016/j.ipl.2007.07.001
https://doi.org/10.1016/j.ipl.2007.07.001
Publikováno v:
Information Processing Letters. 91:19-27
Suppose that a program makes a sequence of m accesses (references) to data blocks; the cache can hold k < m blocks. An access to a block in the cache incurs one time unit, and fetching a missing block incurs d time units. A fetch of a new block can b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c07bc8a1401da2f546a44c285b3657e
https://doi.org/10.1016/j.ipl.2004.03.008
https://doi.org/10.1016/j.ipl.2004.03.008
Publikováno v:
Algorithmica. 31:1-28
Let A and B be two sets of n objects in \reals d , and let Match be a (one-to-one) matching between A and B . Let min(Match ), max(Match ), and Σ(Match) denote the length of the shortest edge, the length of the longest edge, and the sum of the lengt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::279f2dac9603b1ad2fec8c0d9445e1eb
https://doi.org/10.1007/s00453-001-0016-8
https://doi.org/10.1007/s00453-001-0016-8