Results 251 to 260 of about 24,140,341 (301)
Some of the next articles are maybe not open access.

Parallel Sorting with Constant Time for Comparisons

SIAM Journal on Computing, 1981
We prove that there exist graphs with n vertices and at most $2n^{5/3} \log n$ edges for which every acyclic orientation has in its transitive closure at least $\begin{pmatrix} n \\ 2 \end{pmatrix} - 10n^{5/3} $ arcs. We conclude that with $2n^{5/3} \log n$ parallel processors n items may be sorted with all comparisons arranged in two time intervals ...
Roland HÀggkvist, Pavol Hell
openaire   +2 more sources

200 FPS Constant-Time Bilateral Filter Using SVD and Tiling Strategy

International Conference on Information Photonics, 2019
This paper presents a constant-time bilateral filter that supports arbitrary range kernel designed via singular value decomposition (SVD). Bilateral filter (BF) suffers from high computational complexity in real-time processing due to the time-variant ...
Kenjiro Sugimotoy   +2 more
semanticscholar   +1 more source

Constant time modular inversion

Journal of Cryptographic Engineering, 2014
Simple power analysis is a common technique to attack software implementations, especially in the realm of public-key cryptography. An effective countermeasure to protect an implementation is to ensure constant (worst-case) runtime. In this paper we show how to modify an algorithm by Kaliski to compute the Montgomery inverse such that it can compute ...
openaire   +1 more source

Constant Time Recovery in Azure SQL Database

Proceedings of the VLDB Endowment, 2019
Azure SQL Database and the upcoming release of SQL Server introduce a novel database recovery mechanism that combines traditional ARIES recovery with multi-version concurrency control to achieve database recovery in constant time, regardless of the size ...
Panagiotis Antonopoulos   +9 more
semanticscholar   +1 more source

Constant Time Generation of Set Partitions

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2005
In this paper we give a simple algorithm to generate all partitions of {1, 2, ..., n} into k non-empty subsets. The number of such partitions is known as the Stirling number of the second kind. The algorithm generates each partition in constant time without repetition.
Shin-ichiro Kawano, Shin-Ichi Nakano
openaire   +1 more source

Constant Time Enumeration by Amortization

2015
Enumeration algorithms have been one of recent hot topics in theoretical computer science. Different from other problems, enumeration has many interesting aspects, such as the computation time can be shorter than the total output size, by sophisticated ordering of output solutions.
openaire   +1 more source

Constant-time monocular self-calibration

2014 IEEE International Conference on Robotics and Biomimetics (ROBIO 2014), 2014
This paper describes an extensible framework for real-time self-calibration of cameras in the simultaneous mapping and localization (SLAM) setting. The system is demonstrated to calibrate both pinhole and fish-eye camera models from unknown initial parameters while seamlessly solving the maximum likelihood online SLAM problem in real-time.
Nima Keivan, Gabe Sibley
openaire   +1 more source

A practical constant time sorting network

Proceedings of International Conference on Application Specific Array Processors (ASAP '93), 2002
The authors propose a novel VLSI sorting network implementing Leighton's column sort. The network is mech-based and modular; it consists of comparison-exchange processing elements (PEs), routing paths, and short broadcast buses. Each bus contains a small number of simple switches that the authors call shift switches.
Rong Lin, Stephan Olariu
openaire   +1 more source

Constant-Time Multidimensional Electrophoretic NMR

Journal of Magnetic Resonance, 2002
Multidimensional electrophoretic NMR (ENMR) has been introduced to determine structures of coexisting proteins and protein conformations in solution. Signals of different proteins are separated in a new dimension of electrophoretic flow according to their characteristic electrophoretic mobilities.
Ercheng, Li, Qiuhong, He
openaire   +2 more sources

Sequence Analysis in Constant Time on BSR

2006 Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06), 2006
Sequence analysis is an important research method in bioinformatics. Constant time solutions on BSR can be found in the literature to many applications. In this paper, some problems of sequence analysis are involved, and the constant time solutions on BSR to them are proposed, which is the first constant time solutions to the problems on any model of ...
Limin Xiang, Kai Cheng, Kazuo Ushijima
openaire   +1 more source

Home - About - Disclaimer - Privacy