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
Analysis and Evaluation of Non-Blocking Interpolation Search Trees
[article]
2020
arXiv
pre-print
Preserved Fulltext
We start by summarizing the recently proposed implementation of the first non-blocking concurrent interpolation search tree (C-IST) data structure. ...
Finally, we present an extended experimental evaluation of the non-blocking IST performance. ...
Introduction The recently proposed non-blocking interpolation search tree (C-IST) improves the asymptotic complexity of the basic tree operations, such as insertion, lookup and predecessor queries, from ...
arXiv:2001.00413v1
fatcat:etlzqflq5zbdtptkt6wo2qu2hq
Hardware Implementation for the HEVC Fractional Motion Estimation Targeting Real-Time and Low-Energy
2016
Journal of Integrated Circuits and 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 2021; you can also visit the original URL.
The file type is application/pdf.
This approach reduces about 59% the total encoding time and, as a penalty, it leads to an increase of only 4% in the bit rate for the same image quality. ...
An extensive software evaluation was performed to guide the hardware design. ...
ACKNOWLEDGEMENTS We have a special acknowledgement to CNPq, CAPES and FAPERGS to support this work. ...
doi:10.29292/jics.v11i2.435
fatcat:cnhpnrzjcjbytfn76pau6icou4
NEFOS: Rapid Cache-Aware Range Query Processing with Probabilistic Guarantees
[chapter]
2011
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.
position) and searching in O(log B log n) expected block transfers, (B= disk block size and n= number of stored elements). ...
Our expected search bound constitutes an improvement over the O(log B log n) expected bound for search achieved by the ISB-tree (Interpolation Search B-tree), since the latter holds with high probability ...
The ISB-tree. The ISB-tree is a two-level data structure. The upper level is a non -straightforward externalization of the Static Interpolation Search Tree (SIST) presented in [11] . ...
doi:10.1007/978-3-642-23088-2_5
fatcat:2f6iiorwr5hs5mup5bmbjpx3oi
ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour
[chapter]
2005
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.
We present the interpolation search B-tree (ISB-tree), a new cache-aware indexing scheme that supports update operations (insertions and deletions) in O (1) worst-case block transfers and search operations ...
Our update and expected search bounds constitute a considerable improvement over the O (log B n) worst-case block transfer bounds for search and update operations achieved by the B-tree and its numerous ...
We are also indebted to the anonymous referees for their comments that improved the presentation of the paper. ...
doi:10.1007/11602613_33
fatcat:zse5yveecradpgk6k4g3e5ehcq
ISB-tree: A new indexing scheme with efficient expected behaviour
2010
Journal of Discrete Algorithms
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.
We present the interpolation search B-tree (ISB-tree), a new cache-aware indexing scheme that supports update operations (insertions and deletions) in O (1) worst-case block transfers and search operations ...
Our update and expected search bounds constitute a considerable improvement over the O (log B n) worst-case block transfer bounds for search and update operations achieved by the B-tree and its numerous ...
We are also indebted to the anonymous referees for their comments that improved the presentation of the paper. ...
doi:10.1016/j.jda.2010.08.001
fatcat:77vb7b7ykjeobds7xadliwj5fi
Efficient computation of partition of unity interpolants through a block-based searching technique
[article]
2016
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.
This approach allows us to examine only a reduced number of blocks in the search process of the nearest neighbour points, leading to an optimized searching routine. ...
Complexity analysis and numerical experiments in two- and three-dimensional interpolation support our findings. Some applications to geometric modelling are also considered. ...
In Table 3 , we sum up the the total computational cost of the block-based partitioning and searching procedures, compared with kd-trees. ...
arXiv:1604.04585v1
fatcat:fhamgxflmnfpvpb3zmx7n4bdqy
Energy and Rate-Aware Design for HEVC Motion Estimation Based on Pareto Efficiency
2018
Journal of Integrated Circuits and 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 2019; you can also visit the original URL.
The file type is application/pdf.
Based on evaluations with the HEVC Reference Software, a complexity-reduction strategy was adopted in the developed architecture that mainly consists of supporting only the 8x8, 16x16, 32x32, and 64x64 ...
The architecture allows an external control unit selects a subset of these four PU sizes according to the energy and rate targets for a specific application. ...
ACKNOWLEDGEMENTS We have a special acknowledgement to CNPq, CAPES and FAPERGS to support this work. ...
doi:10.29292/jics.v13i1.18
fatcat:ul4sczkanvfdhgokum7evmdkxu
A cell-centred finite volume method for the Poisson problem on non-graded quadtrees with second order accurate gradients
2017
Journal of Computational Physics
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 2019; you can also visit the original URL.
The file type is application/pdf.
To properly recover second order accuracy in the resulting numerical gradients, prior work addressing block-structured grids and graded trees has shown that quadratic, rather than linear, interpolation ...
However, previous schemes fail or lose accuracy in the presence of the more complex T-junction geometries arising in the case of general non-graded quadtrees, which place no restrictions on the resolution ...
I am also thankful to the members of the Computational Motion Group at Waterloo for discussions that helped to inspire and improve this work, and to Robert Bridson for suggestions related to compatibility ...
doi:10.1016/j.jcp.2016.11.035
fatcat:hcuggqdy3fcyjfymqgpk3zsqfy
Assessing geologic model uncertainty - a case study comparing methods
2019
REM: International Engineering 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 2020; you can also visit the original URL.
The file type is application/pdf.
Evaluating mineral resources requires the prior delimitation of geologically homogeneous stationary domains. ...
This uncertainty, related to the location of the boundary between distinct geological domains can be one of the major sources of uncertainty in a mineral project, and should be assessed due to its potential ...
The number of categories and the size of the TI also affect the size of the search tree. Figure 2 on the right shows a search tree constructed from the training image and the template. ...
doi:10.1590/0370-44672019720037
fatcat:xyyn4vtn75hitbnlasvepaa2va
Stereo video coding based on quad-tree decomposition of B–P frames by motion and disparity interpolation
2005
IEE Proceedings - Vision Image and Signal Processing
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.
The block size is controlled by quad-tree decomposition of the processed frame based on a ratedistortion splitting criterion. ...
For the prediction of a macroblock, optimized motion and disparity vectors are jointly estimated and the participating proportion of each similarity is suitably searched. ...
or disparity vector for each block. • The quad-tree analysis is continued for the blocks of larger size but with a different splitting criterion. ...
doi:10.1049/ip-vis:20045033
fatcat:rgk4rj3s2ndjtl2whdmcgaqnsq
Classification and Diagnosis of Cardiac Arrhythmia using an ECG-based Ensemble Approach
2018
Journal of Biomedical Engineering and Medical Imaging
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 boosted decision tree ensemble created to evaluate cardiac condition performs best, with an overall accuracy of 84.6% and an AUC of 0.828. ...
In order to develop an accurate and objective method for ECG analysis, this study evaluates various ensemble algorithms to design and create a supervised classification model. ...
Thus, there is a clear and present need for an objective, accurate, and rapid method of ECG analysis. ...
doi:10.14738/jbemi.55.5452
fatcat:dtabeit4wnat7bsyvtzzmwawfq
Interpolating Leaf Quad Tree image compression
2013
2013, 7th International Conference on Signal Processing and Communication Systems (ICSPCS)
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.
This paper presents a novel variation of the QT called the Interpolating Leaf Quad Tree (ILQT). ...
The ILQT uses QT decomposition, combined with bi-linear interpolation to better approximate image blocks. ...
For decompression, the ST requires a search of the tree to find corner values for interpolation. ...
doi:10.1109/icspcs.2013.6723966
dblp:conf/icspcs/LincolnG13
fatcat:y5mtqt4it5gw7cfexdw2hsi42e
Software Model Checking via IC3
[chapter]
2012
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 2019; you can also visit the original URL.
The file type is application/pdf.
Third, we cast this approach in the framework of lazy abstraction with interpolants, and optimize it by using interpolants extracted from proofs, when useful. ...
Second, to leverage the Control-Flow Graph (CFG) of the program being analyzed, we adapt the "linear" search style of IC3 to a treelike search. ...
We would like to thank Ken McMillan and the anonymous referees for their very helpful comments on early versions of the paper. ...
doi:10.1007/978-3-642-31424-7_23
fatcat:a2bgpg6v5zbgdpnn3lrbq4kgli
Algorithm and architecture design of the motion estimation for the H.265/HEVC 4K-UHD encoder
2015
Journal of Real-Time Image Processing
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.
The motion estimation for larger blocks is performed by the utilization of results of the 8 9 8 search. ...
A separate interpolator for chroma additionally increases the throughput. The integer-pel path supports test zone search for 8 9 8 prediction blocks. ...
, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. ...
doi:10.1007/s11554-015-0516-4
fatcat:ylmqburjrzbu5bt3ls4i7yqh7a
Satisficing search algorithms for selecting near-best bases in adaptive tree-structured wavelet transforms
1996
IEEE Transactions on Signal Processing
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 2004; you can also visit the original URL.
The file type is application/pdf.
Any of a variety of additive or non-additive information cost functions can be used as the decision criterion for comparing and selecting nodes when searching through the tree. ...
Experimental results comparing the various information cost functions and basis selection methods are demonstrated for both data compression of real speech and time-frequency analysis of artificial transients ...
Papanicolaou, and M. V. Wickerhauser for helpful discussions. ...
doi:10.1109/78.539028
fatcat:lfal7b7edna5plsqz4cir2mgzy
« Previous
Showing results 1 — 15 out of 19,290 results