Zobrazeno 1 - 10
of 256
pro vyhledávání: '"Ogihara, Mitsunori"'
Autor:
Ogihara, Mitsunori, Uchizawa, Kei
Dynamical Systems is a field that studies the collective behavior of objects that update their states according to some rules. Discrete-time Boolean Finite Dynamical System (DT-BFDS) is a subfield where the systems have some finite number of objects
Externí odkaz:
http://arxiv.org/abs/2211.07923
$d$-dimensional (for $d>1$) efficient range-summability ($d$D-ERS) of random variables (RVs) is a fundamental algorithmic problem that has applications to two important families of database problems, namely, fast approximate wavelet tracking (FAWT) o
Externí odkaz:
http://arxiv.org/abs/2110.07753
Efficient range-summability (ERS) of a long list of random variables is a fundamental algorithmic problem that has applications to three important database applications, namely, data stream processing, space-efficient histogram maintenance (SEHM), an
Externí odkaz:
http://arxiv.org/abs/2109.06366
Approximate Nearest Neighbor Search (ANNS) is a fundamental algorithmic problem, with numerous applications in many areas of computer science. Locality-sensitive hashing (LSH) is one of the most popular solution approaches for ANNS. A common shortcom
Externí odkaz:
http://arxiv.org/abs/2103.05864
Set reconciliation is a fundamental algorithmic problem that arises in many networking, system, and database applications. In this problem, two large sets A and B of objects (bitcoins, files, records, etc.) are stored respectively at two different ne
Externí odkaz:
http://arxiv.org/abs/2007.14569
Autor:
Vedula, Nikhita, Sun, Wei, Lee, Hyunhwan, Gupta, Harsh, Ogihara, Mitsunori, Johnson, Joseph, Ren, Gang, Parthasarathy, Srinivasan
The rapid advances in e-commerce and Web 2.0 technologies have greatly increased the impact of commercial advertisements on the general public. As a key enabling technology, a multitude of recommender systems exists which analyzes user features and b
Externí odkaz:
http://arxiv.org/abs/1709.03946
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Theoretical Computer Science 1 March 2019 762:25-40
Autor:
Alcazar, Oscar1 (AUTHOR), Ogihara, Mitsunori2,3 (AUTHOR) m.ogihara@miami.edu, Ren, Gang2,3 (AUTHOR) m.ogihara@miami.edu, Buchwald, Peter1,4 (AUTHOR) m.ogihara@miami.edu, Abdulreda, Midhat H.1,5,6,7 (AUTHOR) m.ogihara@miami.edu
Publikováno v:
Biomolecules (2218-273X). Oct2022, Vol. 12 Issue 10, pN.PAG-N.PAG. 21p.
We study the question of whether every P set has an easy (i.e., polynomial-time computable) census function. We characterize this question in terms of unlikely collapses of language and function classes such as the containment of #P_1 in FP, where #P
Externí odkaz:
http://arxiv.org/abs/cs/9809002