Results 1  10
of
1,142,654
Comparative Analysis of Exhaustive Search Algorithm with ARPS Algorithm for Motion Estimation
"... Accurate motion estimation is a key factor for achieving enhanced compression ratio. It is the process of determining an offset to a suitable reference area in previously coded frame and has a significant effect on performance of coders and decoders (CODEC). This paper compares the performance of Ad ..."
Abstract
 Add to MetaCart
of Adaptive Rood Pattern Search (ARPS) motion estimation algorithm with Exhaustive search (ES) algorithm in terms of computational complexity being applied on MATLAB platform for different dimensional images. Several significant parameters such as number of computations and cost to determine the motion
Analysis of an exhaustive search algorithm in random graphs and the n c log n asymptotics. Submitted for publication
"... We analyze the cost used by a naive exhaustive search algorithm for finding a maximum independent set in random graphs under the usual Gn;pmodel where each possible edge appears independently with the same probability p. The expected cost turns out to be of the less common asymptotic order n c log ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We analyze the cost used by a naive exhaustive search algorithm for finding a maximum independent set in random graphs under the usual Gn;pmodel where each possible edge appears independently with the same probability p. The expected cost turns out to be of the less common asymptotic order n c log
New Results on Exhaustive Search Algorithm for Motion Estimation using Adaptive Partial Distortion Search and Successive Elimination Algorithm
"... Abstract — Motion estimation is one of the most computationalintensive tasks in video compression. In order to reduce the amount of computation, various fast motion estimation algorithms have been developed. These fast algorithms can be classified into two groups. One is the lossy motionestimation ..."
Abstract
 Add to MetaCart
estimation approach, which may have some degradation of predicted images, and the other is lossless, which means that the quality of the predicted images is exactly the same as those obtained by the conventional full search algorithm. The partial distortion search and successive elimination algorithm are two well
Average Case Analysis of NPcomplete Problems: Maximum Independent Set and Exhaustive Search Algorithms
"... In this article, we deal with rigorous average case analysis of NP complete problems, relying on some mathematical tools from complex analysis and probability theory. We consider here one of the historical prototype of such problems: Maximum Independent Set (MIS). For a large class of exhaustive alg ..."
Abstract
 Add to MetaCart
is also a deep motivation for considering our class of exhaustive TarjanChvàtal like algorithms), and numerous constraint satisfaction problems.
The Use of a Novel SemiExhaustive Search Algorithm for the Analysis of Data Sensitivity in a Feature Subset Selection Problem
, 2006
"... 1.1 searchbased Software Engineering...................... 6 ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
1.1 searchbased Software Engineering...................... 6
Randomized Algorithms
, 1995
"... Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available, or the simp ..."
Abstract

Cited by 2210 (37 self)
 Add to MetaCart
Randomized algorithms, once viewed as a tool in computational number theory, have by now found widespread application. Growth has been fueled by the two major benefits of randomization: simplicity and speed. For many applications a randomized algorithm is the fastest algorithm available
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
The Viterbi algorithm
 Proceedings of the IEEE
, 1973
"... vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A ..."
Abstract

Cited by 985 (3 self)
 Add to MetaCart
vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A799A804, 1964. [9] T. C. Mo, “Theory of electrodynamics in media in noninertial frames and applications, ” J. Math. Phys., vol. 11, pp. 25892610, 1970.
Depth first search and linear graph algorithms
 SIAM JOURNAL ON COMPUTING
, 1972
"... The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect ..."
Abstract

Cited by 1384 (19 self)
 Add to MetaCart
The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components
A Fast Quantum Mechanical Algorithm for Database Search
 ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract

Cited by 1126 (10 self)
 Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a
Results 1  10
of
1,142,654