A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Strengthened Lazy Heaps: Surpassing the Lower Bounds for Binary Heaps
[article]
2014
arXiv
pre-print
Preserved Fulltext
In particular, these bounds for both insert and extract-min -and the time bound for insert- surpass the corresponding lower bounds known for binary heaps, though our data structure is similar. ...
To surpass the lower bound for insert, we buffer insertions and allow O(^2 n) nodes to violate heap order in relation to their parents. ...
It is interesting that we could surpass the two lower bounds known for binary heaps [13] by slightly loosening the assumptions that are intrinsic to these lower bounds. ...
arXiv:1407.3377v1
fatcat:qjfb7kv7cbhq7dcrh2dosfqt6m
Optimizing Binary Heaps
2017
Theory of Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
These efficiencies surpass lower bounds known for binary heaps, thereby resolving a long-standing theoretical debate. ...
In particular, for the standard implementation of binary heaps, insert and extract-min operate in logarithmic time while involving at most lg n and 2 lg n [could possibly be reduced to lg lg n + O(1) and ...
Although, compared to a binary heap, we surpass the comparison bound for extract-min and the time bound for insert [27] , our data structure is similar to a binary heap. ...
doi:10.1007/s00224-017-9760-2
fatcat:ditlvwyqezddvhwzh7cly6azvm
Soft Sequence Heaps
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
It is based on ternary trees instead of binary trees and matches the time bounds of Kaplan et al., i.e. amortized O(1) insertions and amortized O((1/ϵ)) extract-min. ...
The main contribution of this paper is an alternative soft heap implementation based on merging sorted sequences, with time bounds matching those of Chazelle's soft heaps. ...
Introduction Chazelle in 1998 [6] introduced the soft heap as a heap data structure surpassing the comparison lower bounds of heaps by allowing the controlled corruptions of keys, i.e. artificially increasing ...
arXiv:2008.05398v1
fatcat:4yw6tcdeibd5hbobcaeqclbgea
An experimental evaluation and analysis of database cracking
2015
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Several works have proposed different cracking techniques for different aspects including updates, tuple-reconstruction, convergence, concurrency control, and robustness. ...
Our 2014 VLDB paper "The Uncracked Pieces in Database Cracking" 1 was the first comparative study of these different methods by an independent group. ...
Buffered crack-in-two collects the swap pairs in two heaps: a max-heap for values that should go to the upper partition and a min-heap for values that should go to the lower partition. ...
doi:10.1007/s00778-015-0397-y
fatcat:ooqhsy54bvhktbycv7lvn4eftu
Optimizing Compilation and Computational Complexity of Constraint Handling Rules
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Originally designed in the early 1990s as a specialpurpose programming language for adding user-defined constraint solvers to a host language, CHR has evolved over the last decade into a powerful and elegant ...
In the second part, we improve the state of the art by proposing and implementing several compiler optimizations. ...
Whether this lower bound can be achieved is not clear. ...
doi:10.1007/978-3-642-02846-5_41
fatcat:ywwhwcnysbea3alkxbrz7ppfxe
Comprehensive formal verification of an OS microkernel
2014
ACM Transactions on Computer Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
worst-case execution time analysis of the binary, and an automatic initialiser for user-level systems that connects kernel-level access-control enforcement with reasoning about system behaviour. ...
verified IPC fastpath, a proof that the binary code of the kernel correctly implements the C semantics, a proof of correct access-control enforcement, a proof of information-flow noninterference, a sound ...
ACKNOWLEDGMENTS We would like to acknowledge the contribution of the following people in the different parts of this work, spanning multiple years and projects. ...
doi:10.1145/2560537
fatcat:wgaqjtqacfen3nd2apj4z4eldm
seL4
2009
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles - SOSP '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
We present our experience in performing the formal, machine-checked verification of the seL4 microkernel from an abstract specification down to its C implementation. ...
Complete formal verification is the only known way to guarantee that a system is free of programming errors. ...
Acknowledgements We thank Timothy Bourke, Timothy Roscoe, and Adam Wiggins for valued feedback on drafts of this article. ...
doi:10.1145/1629575.1629596
dblp:conf/sosp/KleinEHACDEEKNSTW09
fatcat:cidf7z4awnhyfljpznijerhee4
Townsend_columbia_0054D_15370.pdf
[article]
2019
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
HLS tools typically provide imperative, side-e ectful languages to the designer, which makes it di cult to correctly specify and optimize complex, memory-bound applications. ...
Compiling Irregular Software to Specialized Hardware Richard Townsend High-level synthesis (HLS) has simpli ed the design process for energy-e cient hardware accelerators: a designer speci es an accelerator's ...
calls, surpassing a limit imposed by the compiler. ...
doi:10.7916/d8-0sqy-pv45
fatcat:stqkdihs2zhbpj25slwdmdap2y
Deductive Verification of Safety-Critical Java Programs
2009
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A focus is put on the formalization of the RTSJ memory model in dynamic logic, the utilization of a region-based memory model for ensuring non-interference and a design-by-contract based approach for the ...
This work investigates the application of deductive verification techniques to safety critical Java programs, in particular RTSJ programs. ...
in φ[n]) resulting in a new upper/lower bound of the form ±n + c ± 1. ...
doi:10.5445/ir/1000014087
fatcat:b4jmjvi3ljaylmmn5rdrm6kkju
Closing the circle of algorithmic and system-centric database optimization : a comprehensive survey on adaptive indexing, data partitioning, and the rewiring of virtual memory
[article]
2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Over the decades, with the increase of computing resources, the amount of data to manage also increased tremendously. ...
Thus, in the first part of this thesis, we will reinvestigate, analyze, and enhance the class of adaptive indexing methods in a comprehensive evaluation on the algorithmic level. ...
Buffered crack-in-two collects the swap pairs in two heaps: a max-heap for values that should go to the upper partition and a min-heap for values that should go to the lower partition. ...
doi:10.22028/d291-26682
fatcat:ws2rov2lwzefzfopv6edncr66m
At Zero Point: Discourse, Culture, and Satire in Restoration England
1999
Rocky Mountain Review of Language and Literature (RMMLA)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
and money is the exact inverse of the hero's-as the new binary model for satire demands. ...
Miller, 48 would have it, for paradoxical encomium entals no more than a simple binary inversion. ...
doi:10.2307/1347966
fatcat:gr7i3pzjvjc4hgmqncm3rvyw2e
Dagstuhl Reports, Volume 4, Issue 11, November 2014, Complete Issue
[article]
2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
), focussing on techniques for proving tight runtime lower bounds under ETH. ...
Transitive Reduction for Inference of Biological Networks on GPUs Last but not least, we will look at the latest developments of Fibonacci heaps, comparing enhanced lazy Fibonacci heaps that apply naive ...
Allowing a limited number of heap violating nodes and by strengthening the heap condition in bottom trees this construction bypasses a well-known bound for heaps. ...
doi:10.4230/dagrep.4.11
fatcat:zzps76cx7rfldla5z5dikvsqbe
Asian Social Science, Vol. 4, No. 8, August, 2008
2009
Asian Social Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Cognitive Perspective 102 Abstract Human capital information which is vital for effective management of resources is usually only accessible internally within an organization. ...
This paper examines the extent of the disclosure of human capital in the annual reports of Malaysian top companies based on the concept of Human Resource Costing and Accounting (HRCA) and other relevant ...
The result of the study could provide an insight into the Malaysian construction project development and will hopefully provide valuable guidelines, especially to public or private sectors in Malaysia. ...
doi:10.5539/ass.v4n8p0
fatcat:rb4c3wjaszb2pavwg7kotfxjpy
Gender Ambivalence in John Keats's Lamia, Isabella, and The Eve of St. Agnes
2020
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Agnes (1820) Keats expresses a pioneering gender ambivalence through underlying, but perceptible, attacks on social conventions, and prejudices that constrict people by shaping and reinforcing binary perceptions ...
John Keats's theories of Negative Capability and the chameleonic poetical character are the foundations of his poetry. ...
The believers, like Madeline, the Beadsman and Angela, are bound to an illusory reality that has been set out for them by the authority of the Church. ...
doi:10.26262/heal.auth.ir.320910
fatcat:rlfoajbtdzccncdwfr6clbyhqu
Correspondents Theory 1800/2000: Philosophical Reflections Upon Epistolary Technics And Praxis In The Analogue And Digital
2015
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
(whether optimistic or pessimistic) for the ways in which the Internet effects change in culture, society and self. ...
The thesis is structured thematically, with chapters examining the experience of distance and presence in these two periods, the potential for meaningful engagements by way of communicative media, the ...
which surpasses all signs. ...
doi:10.5281/zenodo.13889
fatcat:mzjqiccd55cmvj7yvm67wzvnlm
« Previous
Showing results 1 — 15 out of 272 results