Zobrazeno 1 - 10
of 2 288
pro vyhledávání: '"Young, Neal"'
Autor:
Chrobak, Marek, Young, Neal E.
Given a weighted, ordered query set $Q$ and a partition of $Q$ into classes, we study the problem of computing a minimum-cost decision tree that, given any query $q$ in $Q$, uses equality tests and less-than comparisons to determine the class to whic
Externí odkaz:
http://arxiv.org/abs/2302.09692
Autor:
Chrobak, Marek, Haney, Samuel, Liaee, Mehraneh, Panigrahi, Debmalya, Rajaraman, Rajmohan, Sundaram, Ravi, Young, Neal E.
Publikováno v:
Algorithmica (2004)
It is natural to generalize the online $k$-Server problem by allowing each request to specify not only a point $p$, but also a subset $S$ of servers that may serve it. For uniform metrics, the problem is equivalent to a generalization of Paging in wh
Externí odkaz:
http://arxiv.org/abs/2206.05579
Autor:
Kusne, Yael, Ghorbanzadeh, Atefeh, Dulau-Florea, Alina, Shalhoub, Ruba, Alcedo, Pedro E., Nghiem, Khanh, Ferrada, Marcela A., Hines, Alexander, Quinn, Kaitlin A., Panicker, Sumith R., Ombrello, Amanda K., Reichard, Kaaren, Darden, Ivana, Goodspeed, Wendy, Durrani, Jibran, Wilson, Lorena, Olteanu, Horatiu, Lasho, Terra, Kastner, Daniel L., Warrington, Kenneth J., Mangaonkar, Abhishek, Go, Ronald S., Braylan, Raul C., Beck, David B., Patnaik, Mrinal M., Young, Neal S., Calvo, Katherine R., Casanegra, Ana I., Grayson, Peter C., Koster, Matthew J., Wu, Colin O., Kanthi, Yogendra, Patel, Bhavisha A., Houghton, Damon E., Groarke, Emma M.
Publikováno v:
In Blood 23 May 2024 143(21):2190-2200
Publikováno v:
ACM Transactions on Algorithms 18(1) (2022) 1-11
We present a simple $O(n^4)$-time algorithm for computing optimal search trees with two-way comparisons. The only previous solution to this problem, by Anderson et al., has the same running time, but is significantly more complicated and is restricte
Externí odkaz:
http://arxiv.org/abs/2103.01084
Publikováno v:
Information and Computation 281 (2021)
Search trees are commonly used to implement access operations to a set of stored keys. If this set is static and the probabilities of membership queries are known in advance, then one can precompute an optimal search tree, namely one that minimizes t
Externí odkaz:
http://arxiv.org/abs/2103.01052
Autor:
Gutierrez-Rodrigues, Fernanda, Groarke, Emma M., Thongon, Natthakan, Rodriguez-Sevilla, Juan Jose, Catto, Luiz Fernando B., Niewisch, Marena R., Shalhoub, Ruba, McReynolds, Lisa J., Clé, Diego V., Patel, Bhavisha A., Ma, Xiaoyang, Hironaka, Dalton, Donaires, Flávia S., Spitofsky, Nina, Santana, Barbara A., Lai, Tsung-Po, Alemu, Lemlem, Kajigaya, Sachiko, Darden, Ivana, Zhou, Weiyin, Browne, Paul V., Paul, Subrata, Lack, Justin, Young, David J., DiNardo, Courtney D., Aviv, Abraham, Ma, Feiyang, De Oliveira, Michel Michels, de Azambuja, Ana Paula, Dunbar, Cynthia E., Olszewska, Malgorzata, Olivier, Emmanuel, Papapetrou, Eirini P., Giri, Neelam, Alter, Blanche P., Bonfim, Carmem, Wu, Colin O., Garcia-Manero, Guillermo, Savage, Sharon A., Young, Neal S., Colla, Simona, Calado, Rodrigo T.
Publikováno v:
In Blood September 2024
Publikováno v:
ACM Trans. Algorithms. June 2024
Data-structure dynamization is a general approach for making static data structures dynamic. It is used extensively in geometric settings and in the guise of so-called merge (or compaction) policies in big-data databases such as Google Bigtable and L
Externí odkaz:
http://arxiv.org/abs/2011.02615
Publikováno v:
Journal of Bioinformatics and Computational Biology 5(4) 937-961, 2007
We study the problem of selecting control clones in DNA array hybridization experiments. The problem arises in the OFRG method for analyzing microbial communities. The OFRG method performs classification of rRNA gene clones using binary fingerprints
Externí odkaz:
http://arxiv.org/abs/2005.13645
Publikováno v:
Distributed Computing 24, 45--63 (2011)
This paper gives poly-logarithmic-round, distributed D-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-cost Covering). The approximation ratio D is the maximum number of variables in a
Externí odkaz:
http://arxiv.org/abs/2005.13628
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.