Zobrazeno 1 - 10
of 20
pro vyhledávání: '"John Howat"'
Autor:
Imogen Rogers, Tom Grice-Jackson, Elizabeth Ford, John Howat, Remya Salimkumar, Kat Frere-Smith, Nicola O’Connor, Hilde Bastiaens, Harm van Marwijk
Publikováno v:
PLOS Digital Health, Vol 2, Iss 11 (2023)
Externí odkaz:
https://doaj.org/article/9630958afeb84ff48fe33a559e881454
Author(s): Farley, Chandra; Howat, John; Bosco, Jenifer; Thakar, Nidhi; Wise, Jake; Su, Jean | Abstract: Increasingly, states are recognizing equity as a goal of utility regulation, going beyond traditionally stated objectives to ensure that electric
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e9c337714b1e817bf6f6297d0c7b3b1
https://doi.org/10.2172/1828753
https://doi.org/10.2172/1828753
Author(s): Jones, Philip B; Levy, Jonathan; Bosco, Jenifer; Howat, John; Alst, John W Van | Abstract: Electric vehicles (EVs) today are a small part of the U.S. transportation fleet. Technological advancements, automotive industry investments and sta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c2523c67e4da6695d019680d8de9fdc
https://doi.org/10.2172/1464173
https://doi.org/10.2172/1464173
Publikováno v:
Bose, P, Fagerberg, R, Howat, J & Morin, P 2016, ' Biased Predecessor Search ', Algorithmica, vol. 76, no. 4, pp. 1097-1105 . https://doi.org/10.1007/s00453-016-0146-7
We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in particular, we give data structures
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f406945bc8bde70b1b8e08265b41ed21
Publikováno v:
Scopus-Elsevier
Given a bounded universe { 0 , 1 , ? , U - 1 } , we show how to perform predecessor searches in O ( log log Δ ) expected time, where Δ is the difference between the element being searched for and its predecessor in the structure, while supporting u
Autor:
Lisa Wood, Ross Hemphill, John Howat, Ralph Cavanagh, Severin Borenstein, Jeff Deason, Lisa Schwartz
Author(s): Wood, Lisa; Hemphill, Ross; Howat, John; Cavanagh, Ralph; Borenstein, Severin; Deason, Jeff; Schwartz, Lisa | Editor(s): Schwartz, Lisa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::096fc329c4971f8afb7193a8a2c4bd56
https://doi.org/10.2172/1342757
https://doi.org/10.2172/1342757
Publikováno v:
ResearcherID
The time required for a sequence of operations on a data structure is usually measured in terms of the worst possible such sequence. This, however, is often an overestimate of the actual time required. Distribution-sensitive data structures attempt t
Publikováno v:
LATIN 2014: Theoretical Informatics ISBN: 9783642544224
LATIN
ResearcherID
LATIN
ResearcherID
We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in particular, we give data structures
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d642854f65e212e09561a1ea152a55f0
https://doi.org/10.1007/978-3-642-54423-1_65
https://doi.org/10.1007/978-3-642-54423-1_65
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642402722
Space-Efficient Data Structures, Streams, and Algorithms
Space-Efficient Data Structures, Streams, and Algorithms
Distribution-sensitive data structures attempt to exploit patterns in query distributions in order to allow many sequences of queries execute faster than in traditional data structures. In this paper, we survey the history of such data structures, ou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85ccad6c1af17748847a086294edf87a
https://doi.org/10.1007/978-3-642-40273-9_10
https://doi.org/10.1007/978-3-642-40273-9_10