Results 1  10
of
1,334,979
Article Ship Detection with Spectral Analysis of Synthetic Aperture Radar: A Comparison of New and WellKnown Algorithms
"... and other research outputs Ship detection with spectral analysis of synthetic aperture radar: a comparison of new and wellknown algorithms ..."
Abstract
 Add to MetaCart
and other research outputs Ship detection with spectral analysis of synthetic aperture radar: a comparison of new and wellknown algorithms
A Simplified Correctness Proof for a WellKnown Algorithm Computing Strongly Connected Components
"... The computation of the strongly connected components of a directed graph is one of the fundamental algorithmic graph problems. Lineartime algorithms with simple implementations are known. Here a simplified correctness proof for one of these algorithms is presented. ..."
Abstract
 Add to MetaCart
The computation of the strongly connected components of a directed graph is one of the fundamental algorithmic graph problems. Lineartime algorithms with simple implementations are known. Here a simplified correctness proof for one of these algorithms is presented.
Note On a Comparative Evaluation of Nine WellKnown Algorithms for Solving the Cell Formation Problem in Group Technology
"... Abstract. Over the last three decades, numerous algorithms have been proposed to solve the workcell formation problem. For practicing manufacturing managers it would be nice to know as to which algorithm would be most effective and efficient for their specific situation. While several studies have ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
attempted to fulfill this need, most have not resulted in any definitive recommendations and a better methodology of evaluation of cell formation algorithms is urgently needed. Prima facie, the methodology underlying Miltenburg and Zhang’s (M&Z) (1991) evaluation of nine wellknown cell formation
Simulation Study of the Effect of Proposed Parameters of Some Well Known Algorithms for Wireless Networks
"... Abstract—This paper proposes a new designing parameter for scheduling algorithms for IEEE 802.162005 Broadband Wireless Metropolitan Area Networks in TDD mode. While many researchers focuses on the main QoS parameters, Maximum sustained rate(MST), minimum reserved rate, delay and jitter, this resea ..."
Abstract
 Add to MetaCart
, this research focus on burst window size which is a which is a subjective parameter driven from the MST. In this work, a detailed simulation study is carried out for the effect of proposed parameter of some well known algorithms such as Proportional Fairness (PF), Round Robin (RR), and StrictPriority. Analyses
A densitybased algorithm for discovering clusters in large spatial databases with noise
, 1996
"... Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clu ..."
Abstract

Cited by 1722 (69 self)
 Add to MetaCart
of clusters with arbitrary shape and good efficiency on large databases. The wellknown clustering algorithms offer no solution to the combination of these requirements. In this paper, we present the new clustering algorithm DBSCAN relying on a densitybased notion of clusters which is designed to discover
OnLine Construction of Suffix Trees
, 1995
"... An online algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part of the strin ..."
Abstract

Cited by 432 (2 self)
 Add to MetaCart
natural way the wellknown algorithms for constructing suffix automata (DAWGs).
A data locality optimizing algorithm
, 1991
"... 1 Introduction As processor speed continues to increase faster than memory speed, optimizations to use the memory hierarchy efficiently become ever more important. Blocking [9] ortiling [18] is a wellknown technique that improves the data locality of numerical algorithms [1, 6, 7, 12, 13].Tiling c ..."
Abstract

Cited by 805 (16 self)
 Add to MetaCart
1 Introduction As processor speed continues to increase faster than memory speed, optimizations to use the memory hierarchy efficiently become ever more important. Blocking [9] ortiling [18] is a wellknown technique that improves the data locality of numerical algorithms [1, 6, 7, 12, 13].Tiling
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.
Results 1  10
of
1,334,979