Results 221 to 230 of about 410,375 (269)
Some of the next articles are maybe not open access.
Improving the Computational Efficiency of ROVIO
Unmanned Systems, 2023ROVIO is one of the state-of-the-art monocular visual inertial odometry algorithms. It uses an Iterative Extended Kalman Filter (IEKF) to align visual features and update the vehicle state simultaneously by including the feature locations in the state vector of the IEKF.
Stavrow Bahnam +2 more
openaire +2 more sources
Approximate computing and the quest for computing efficiency
Proceedings of the 52nd Annual Design Automation Conference, 2015Diminishing benefits from technology scaling have pushed designers to look for new sources of computing efficiency. Multicores and heterogeneous accelerator-based architectures are a by-product of this quest to obtain improvements in the performance of computing platforms at similar or lower power budgets.
Swagath Venkataramani +3 more
openaire +1 more source
Computing Efficiency in Education
Computer, 2015If computing is to remain the discipline that carries us into the future, computing education must promote energy efficiency.
openaire +2 more sources
Efficient Continuous Skyline Computation
22nd International Conference on Data Engineering (ICDE'06), 2006In a number of emerging streaming applications, the data values that are produced have an associated time interval for which they are valid. A useful computation over such streaming data sets is to produce a continuous and valid skyline summary. To the best of our knowledge, this problem has not been addressed before.
Michael D. Morse +2 more
openaire +2 more sources
On the Computational Efficiency of XTR+
2009XTR is a famous public key cryptosystem and has been well applied into various scenes. Zehui Wang proposed XTR+, an improved version of XTR, in 2006. In this paper, we modify the fast computation algorithms of XTR for XTR+ and get an algorithm which is about ten times faster than the matrix square-and-multiply algorithm.
Ningbo Mu, Yupu Hu, Leyou Zhang
openaire +1 more source
Efficient fixpoint computation
1994Most of the algorithms presented for computing fixpoints have been developed for very specific application areas, e.g. dataflow analysis, abstract interpretation, denotational semantics, system verification, to mention but a few. Surprisingly little attention has been devoted to the construction of general purpose, application independent fixpoint ...
Bart Vergauwen, J. Wauman, Johan Lewi
openaire +2 more sources
Efficient differential timeslice computation
IEEE Transactions on Knowledge and Data Engineering, 1998Transaction-time databases support access to not only the current database state, but also previous database states. Supporting access to previous database states requires large quantities of data and necessitates efficient temporal query processing techniques.
Kristian Torp +2 more
openaire +3 more sources
Energy-Efficient Cloud Computing
The Computer Journal, 2009Energy efficiency is increasingly important for future information and communication technologies (ICT), because the increased usage of ICT, together with increasing energy costs and the need to reduce green house gas emissions call for energy-efficient technologies that decrease the overall energy consumption of computation, storage and communications.
Berl, Andreas +7 more
openaire +2 more sources
Efficient checking of computations
1990We show how to efficiently check computations using only logspace even if they are only given once. This result implies that a polynomial-time verifier can also be restricted to be logspace with essentially no loss in performance. We also use this result to show that every set in N P is equal to h(L) where h is a homomorphism and L is accepted by a one-
openaire +2 more sources
An Analysis of Computational Efficiency of DNA Computing
2002In this paper, we investigate the relation between an experimental condition and computational (reaction) efficiency of a simple model in DNA computing. A DNA computing algorithm needs many chemical and enzyme reactions in its solution process. An experimental condition for DNA computing is generally based on a molecular biology protocol.
Atsushi Kameda +3 more
openaire +1 more source