82,845 Hits in 5.9 sec

Benchmarking access methods for time-evolving regional data

T Tzouramanis
2003 Data & Knowledge Engineering  
In this paper we present a performance comparison of access methods for time-evolving regional data.  ...  Initially, we briefly review four temporal extensions of the Linear Region Quadtree: the Time-Split Linear Quadtree, the Multiversion Linear Quadtree, the Multiversion Access Structure for Evolving Raster  ...  Bernhard Seeger of the University of Marburg for kindly providing the MVBT code.  ... 
doi:10.1016/j.datak.2003.08.002 fatcat:kz3j6tjisjdqnnyfzniazoy4wm

Benchmarking access methods for time-evolving regional data

Theodoros Tzouramanis, Michael Vassilakopoulos, Yannis Manolopoulos
2004 Data & Knowledge Engineering  
In this paper we present a performance comparison of access methods for time-evolving regional data.  ...  Initially, we briefly review four temporal extensions of the Linear Region Quadtree: the Time-Split Linear Quadtree, the Multiversion Linear Quadtree, the Multiversion Access Structure for Evolving Raster  ...  Bernhard Seeger of the University of Marburg for kindly providing the MVBT code.  ... 
doi:10.1016/j.datak.2003.08.008 fatcat:gz6sltta2faa5ipuh3tmyo4uli

On the Generation of Spatiotemporal Datasets [chapter]

Yannis Theodoridis, Jefferson R. O. Silva, Mario A. Nascimento
1999 Lecture Notes in Computer Science  
Abstract An efficient benchmarking environment for spatiotemporal access methods should at least include modules for: generating synthetic datasets, storing datasets (real datasets included), collecting  ...  and running access structures, and visualizing experimental results.  ...  Motivation In the literature, several access methods have been proposed for spatial data without, however, taking the time aspect into consideration.  ... 
doi:10.1007/3-540-48482-5_11 fatcat:swm2dahrqfaihgunxcwib32rpq

Who Watches the Watchmen? An Appraisal of Benchmarks for Multiple Sequence Alignment [chapter]

Stefano Iantorno, Kevin Gori, Nick Goldman, Manuel Gil, Christophe Dessimoz
2013 Msphere  
We outline a set of desirable characteristics for effective benchmarking, and evaluate each strategy in light of them.  ...  We conclude that there is currently no universally applicable means of benchmarking MSA, and that developers and users of alignment tools should base their choice of benchmark depending on the context  ...  Acknowledgements The authors thank Julie Thompson for helpful feedback on the manuscript. CD is supported by SNSF advanced researcher fellowship #136461.  ... 
doi:10.1007/978-1-62703-646-7_4 pmid:24170395 fatcat:2zhcvonmn5hnll3kpc3mg45ad4

On-demand sharing of a high-resolution panorama video from networked robotic cameras

Ni Qin, Dezhen Song
2007 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems  
A user may request a specific region associated with a specific time window.  ...  We present system architecture, user interface, data representation, and encoding/decoding algorithms. In the experiment, we have implemented the system using the MPEG-2 codec.  ...  Volz for his insightful discussions. Thanks are given to H. Lee, Y. Xu, Z. Goodwin, B. Green, and C.  ... 
doi:10.1109/iros.2007.4399255 dblp:conf/iros/QinS07 fatcat:mm4ic4warnenhft5fqvpfnjutq

2020 Global Stocktaking of National Accounts Statistics: Availability for Policy and Surveillance

Andrew Baer, Vanda Guerreiro, Anthony Silungwe
2022 IMF Working Papers  
National accounts compilation requires timely access to source data. Release calendars and benchmark years of GDP estimates are usually aligned with access to key data sources.  ...  Some countries develop benchmark estimates for each year, usually with a two-to-three-year time lag.  ... 
doi:10.5089/9798400201400.001 fatcat:vsslpifrnvatneytax66heh3um

Benchmarking Web API Quality – Revisited [article]

David Bermbach, Erik Wittern
2020 arXiv   pre-print
Their existence, arguably, spurs application innovations, making it easy to integrate data or functionalities.  ...  We repeat this benchmark in 2018 and compare results from these two benchmarks regarding availability and latency.  ...  In this period of time, using pingability as a proxy for accessibility would severely underestimate the API accessibility.  ... 
arXiv:1903.07712v3 fatcat:fpds7kabl5d7hpbevr542xa3fm

Alignathon: a competitive assessment of whole-genome alignment methods

Dent Earl, Ngan Nguyen, Glenn Hickey, Robert S. Harris, Stephen Fitzgerald, Kathryn Beal, Igor Seledtsov, Vladimir Molodtsov, Brian J. Raney, Hiram Clawson, Jaebum Kim, Carsten Kemena (+14 others)
2014 Genome Research  
We provide all data sets, submissions, and assessment programs for further study and provide, as a resource for future benchmarking, a convenient repository of code and data for reproducing the simulation  ...  Published assessments and benchmark data sets for protein and, to a lesser extent, global nucleotide MSAs are available, but less effort has been made to establish benchmarks in the more general problem  ...  Gordon Ringold, the NIH (grant 2U41 HG002371-13), and the NHGRI/NIH (grant 5U01HG004695) for providing funding.  ... 
doi:10.1101/gr.174920.114 pmid:25273068 pmcid:PMC4248324 fatcat:kjkumlwtkvd43nrsissrh5pncy

Multicore-aware reuse distance analysis

Derek L Schuff, Benjamin S Parsons, Vijay S Pai
2010 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)  
These methods are evaluated against a Simics-based coherent cache simulator running several OpenMP and transactionbased benchmarks.  ...  Existing reuse distance analysis methods track the number of distinct addresses referenced between reuses of the same address by a given thread, but do not model the effects of data references by other  ...  All benchmarks were run with 4 threads. The "test" data input was used for SPEC benchmarks and the "W" input size for NAS benchmarks.  ... 
doi:10.1109/ipdpsw.2010.5470780 dblp:conf/ipps/SchuffPP10 fatcat:hnzomp6i25hnjdxl7cysjglquy

Object Detection in Driving Datasets Using a High-Performance Computing Platform: A Benchmark Study

Tahir Emre Kalayci, Gabriela Ozegovic, Bor Bricelj, Marko Lah, Alexander Stocker
2022 IEEE Access  
Thus, providing several datasets containing many and diverse cases for the target problem and sufficient hardware for training and application of ML methods are too critical for achieving accurate results  ...  Hence, we present an object detection benchmark study implementing the knowledge graph-based data integration framework to meet the data requirements and run the implementation on a big data and high-performance  ...  While current systems produce immense volumes of data, at the same time, ML methods require a lot of diverse data and a complete iterative lifecycle with a human-in-the-loop perspective for a good performance  ... 
doi:10.1109/access.2022.3180788 fatcat:eezt4hszpreyjlda4nbkz7cnba

Issues in bioinformatics benchmarking: the case study of multiple sequence alignment

M. R. Aniba, O. Poch, J. D. Thompson
2010 Nucleic Acids Research  
Finally, we propose directions for future developments that will ensure that the bioinformatics benchmarks correspond to the challenges posed by the high throughput data.  ...  We consider several criteria for building good benchmarks and the advantages to be gained when they are used intelligently.  ...  (BIPS) for their support.  ... 
doi:10.1093/nar/gkq625 pmid:20639539 pmcid:PMC2995051 fatcat:nfxihponuzedjosm6cwgcccjee

Global monitoring of the impact of the COVID-19 pandemic through online surveys sampled from the Facebook user base

Christina M. Astley, Gaurav Tuli, Kimberly A. Mc Cord, Emily L. Cohn, Benjamin Rader, Tanner J. Varrelman, Samantha L. Chiu, Xiaoyi Deng, Kathleen Stewart, Tamer H. Farag, Kristina M. Barkume, Sarah LaRocca (+3 others)
2021 Proceedings of the National Academy of Sciences of the United States of America  
COVID-like illness (CLI) signals were correlated with government benchmark data.  ...  We show consistent respondent demographics over time for many countries/territories. Machine Learning models trained on national and pooled global data verified known symptom indicators.  ...  Discussion While many areas of the world have access to sophisticated, timely, and reliable methods for tracking COVID-19 impacts over time, there are billions of people living in regions without these  ... 
doi:10.1073/pnas.2111455118 pmid:34903657 pmcid:PMC8713788 fatcat:2wpd3vfhmzcnlbxrttrul75jca

Evaluation of object-oriented database systems [chapter]

C. Huemer, G. Kappel, S. Rausch-Schott, W. Retschitzegger, A. Min Tjoa, S. Vieweg, R. Wagner
1995 Lecture Notes in Computer Science  
The second part of this chapter surveys existing performance benchmarks for OODBS.  ...  Special emphasis is given to the requirements a benchmark has to fulfill, and to the practical applicability and usefulness of the proposed benchmarks.  ...  Table 6 gives an overview of the benchmark sizes for each of the benchmark databases. The regional database consists of data of a 1280km x 800km rectangle.  ... 
doi:10.1007/3-540-60286-0_96 fatcat:wyrdzsgfkvcvxnznyxzmsaqlqy

Automatically Repairing Concurrency Bugs with ARC [chapter]

David Kelk, Kevin Jalbert, Jeremy S. Bradbury
2013 Lecture Notes in Computer Science  
In this paper we introduce ARC -a fully automated system for repairing deadlocks and data races in concurrent Java programs.  ...  In the first phase, ARC uses a genetic algorithm without crossover to mutate an incorrect program, searching for a variant of the original program that fixes the deadlocks and data races.  ...  In the left part of Figure 1 the read and write method access a shared variable.  ... 
doi:10.1007/978-3-642-39955-8_7 fatcat:s6zv3w4fsjdfxdbh5nojqxcz6m

Auto-scoping for OpenMP Tasks [chapter]

Sara Royuela, Alejandro Duran, Chunhua Liao, Daniel J. Quinlan
2012 Lecture Notes in Computer Science  
Auto-scoping relieved the programmer of determining the data-sharing of variables used in worksharing or parallel regions.  ...  Based on the previous work for worksharing and parallel regions, we present an auto-scoping algorithm to work with OpenMP tasks.  ...  Data race conditions can appear when two threads can access to the same memory unit at the same time and at least one of these accesses is a write.  ... 
doi:10.1007/978-3-642-30961-8_3 fatcat:hubuv2j2c5crjase4wmf7u45iy
« Previous Showing results 1 — 15 out of 82,845 results