Zobrazeno 1 - 10
of 141
pro vyhledávání: '"Ely Porat"'
Publikováno v:
Journal of Data Mining and Digital Humanities, Vol Special Issue on..., Iss Towards a Digital Ecosystem:... (2018)
We propose a method for efficiently finding all parallel passages in a large corpus, even if the passages are not quite identical due to rephrasing and orthographic variation. The key ideas are the representation of each word in the corpus by its two
Externí odkaz:
https://doaj.org/article/b15a5f02cde543f5819dd56cfde9fdbe
Publikováno v:
Journal Of Artificial Intelligence Research, Volume 47, pages 281-311, 2013
We consider how selfish agents are likely to share revenues derived from maintaining connectivity between important network servers. We model a network where a failure of one node may disrupt communication between other nodes as a cooperative game ca
Externí odkaz:
http://arxiv.org/abs/1402.0572
Publikováno v:
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
instname
instname
The Count-Min sketch is the most popular data structure for flow size estimation, a basic measurement task required in many networks. Typically the number of potential flows is large, eliminating the possibility to maintain a counter per flow within
Publikováno v:
Theoretical Computer Science. 793:59-69
Regularities in strings arise in various areas of science, including coding and automata theory, formal language theory, combinatorics, molecular biology and many others. A common notion to describe regularity in a string T is a cover, which is a str
Publikováno v:
33rd SODA 2022
33rd SODA 2022, 2022, Alexandria ( Virtual Conference), United States
33rd SODA 2022, 2022, Alexandria ( Virtual Conference), United States
A Dyck sequence is a sequence of opening and closing parentheses (of various types) that is balanced. The Dyck edit distance of a given sequence of parentheses $S$ is the smallest number of edit operations (insertions, deletions, and substitutions) n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::991d0182ea9380d38340f512bd19bb61
http://arxiv.org/abs/2111.02336
http://arxiv.org/abs/2111.02336
Publikováno v:
Algorithmica. 81:2123-2157
Publikováno v:
PODC
Proceedings of the 39th Symposium on Principles of Distributed Computing
Proceedings of the 39th Symposium on Principles of Distributed Computing
In population protocols, the underlying distributed network consists of n nodes (or agents), denoted by V, and a scheduler that continuously selects uniformly random pairs of nodes to interact. When two nodes interact, their states are updated by app
Publikováno v:
SOSR
Bloom filters are used in many networking applications to answer set membership queries at low cost but suffer from false positives. We study Bloom filter constructions that when representing a set of size up to d taken from a finite universe of size
We consider two closely related problems of text indexing in a sub-linear working space. The first problem is the Sparse Suffix Tree (SST) construction of a set of suffixes $B$ using only $O(|B|)$ words of space. The second problem is the Longest Com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::367331ff5e4b93abbf06971a1de47201
https://doi.org/10.1137/1.9781611975994.37
https://doi.org/10.1137/1.9781611975994.37
Publikováno v:
ACM Transactions on Algorithms. 13:1-26
An approximate sparse recovery system in ℓ 1 norm consists of parameters k , ϵ, N ; an m -by- N measurement Φ; and a recovery algorithm R . Given a vector, x , the system approximates x by xˆ = R (Φ x ), which must satisfy ‖ xˆ- x ‖ 1 ≤