Results 1  10
of
68
A Faster And Simpler Algorithm For Sorting Signed Permutations By Reversals
, 1997
"... We give a quadratictime algorithm for finding the minimum number of reversals needed to sort a signed permutation. Our algorithm is faster than the previous algorithm of Hannenhalli and Pevzner and its faster implementation of Berman and Hannenhalli. The algorithm is conceptually simple and does no ..."
Abstract

Cited by 129 (10 self)
 Add to MetaCart
We give a quadratictime algorithm for finding the minimum number of reversals needed to sort a signed permutation. Our algorithm is faster than the previous algorithm of Hannenhalli and Pevzner and its faster implementation of Berman and Hannenhalli. The algorithm is conceptually simple and does
Approximate String Matching: A Simpler Faster Algorithm
 SIAM J. Comput
, 1998
"... Abstract. We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The first algorithm, which is quite simple, runs in time O ( nk3 + n + m) on all patterns except kbreak periodic m s ..."
Abstract

Cited by 44 (1 self)
 Add to MetaCart
Abstract. We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The first algorithm, which is quite simple, runs in time O ( nk3 + n + m) on all patterns except kbreak periodic m
Faster and Simpler Minimal Conflicting Set Identification., in "Combinatorial Pattern Matching
"... Let C be a finite set of n elements and R = {r1, r2,..., rm} a family of m subsets of C. A subset X of R verifies the Consecutive Ones Property (C1P) if there exists a permutation P of C such that each ri in X is an interval of P. A Minimal Conflicting Set (MCS) S ⊆ R is a subset of R that does not ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
not verify the C1P, but such that any of its proper subsets does. In this paper, we present a new simpler and faster algorithm to decide if a given element r ∈ R belongs to at least one MCS. Our algorithm runs in O(n2m2+nm7), largely improving the current O(m6n5(m+n)2 log(m+n)) fastest algorithm of [Blin et
Finding hidden cliques in linear time
 In 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’10), Discrete Math. Theor. Comput. Sci. Proc., AM
, 2010
"... In the hidden clique problem, one needs to find the maximum clique in an nvertex graph that has a clique of size k but is otherwise random. An algorithm of Alon, Krivelevich and Sudakov that is based on spectral techniques is known to solve this problem (with high probability over the random choice ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
choice of input graph) when k ≥ c √ n for a sufficiently large constant c. In this manuscript we present a new algorithm for finding hidden cliques. It too provably works when k> c √ n for a sufficiently large constant c. However, our algorithm has the advantage of being much simpler (no use
Finding Small Roots of Bivariate Integer Polynomial Equations: a Direct Approach
"... Abstract. Coppersmith described at Eurocrypt 96 an algorithm for nding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later proposed in [9], but it was asymptotically less ecient than Coppersmith's algorithm. In this paper, we describe ..."
Abstract
 Add to MetaCart
Abstract. Coppersmith described at Eurocrypt 96 an algorithm for nding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later proposed in [9], but it was asymptotically less ecient than Coppersmith's algorithm. In this paper, we
Efficient Algorithms for Erasure Node Placement on Slotted Dual Bus Networks
 in Proc
, 1998
"... We study the problem of placing erasure nodes among passive stations in a slotted dual bus network. Erasure nodes are known to improve throughput by allowing slot reuse. It is also known that choices made in locating erasure nodes significantly impact network congestion and overall throughput  esp ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
 especially when traffic patterns exhibit a high degree of locality. We present algorithms to determine optimal placements of erasure nodes that improve upon prior work on this problem: they are simpler and faster polynomialtime algorithms and are easily modified to handle various useful cost measures
A Fast Algorithm for Mining UtilityFrequent
"... Abstract. Utilitybased data mining is a new research area interested in all types of utility factors in data mining processes and targeted at incorporating utility considerations in both predictive and descriptive data mining tasks. High utility itemset mining is a research area of utilitybased des ..."
Abstract
 Add to MetaCart
efficient algorithm FUFM (Fast UtilityFrequent Mining) which finds all utilityfrequent itemsets within the given utility and support constraints threshold. It is faster and simpler than the original 2PUF algorithm (2 Phase UtilityFrequent), as it is based on efficient methods for frequent itemset mining
AlgorithmHardware Codesign of Fast Parallel RoundRobin Arbiters
"... Abstract—As a basic building block of a switch scheduler, a fast and fair arbiter is critical to the efficiency of the scheduler, which is the key to the performance of a highspeed switch or router. In this paper, we propose a parallel roundrobin arbiter (PRRA) based on a simple binary search algo ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
algorithm, which is specially designed for hardware implementation. We prove that our PRRA achieves roundrobin fairness under all input patterns. We further propose an improved (IPRRA) design that reduces the timing of PRRA significantly. Simulation results with TSMC.18 m standard cell library show
A RECURSIVE, LINEINTERSECTION METHOD FOR FINDING THE AREA OF A MESH PROJECTED ONTO A PLANE
"... ABSTRACT In this paper, we describe a new approach for computing the area of a mesh projected onto a plane. This approach utilizes the graphics hardware's line/object intersection capability and a recursive subdivision strategy to achieve performance and precision control. This approach starts ..."
Abstract
 Add to MetaCart
techniques [Vatti, '92][Murta]. Although the problem of polygon clipping has been solved, it is timeconsuming to execute when processing large scale CAE meshes due to it's higherthanlinear time complexity. Polygon clipping algorithms are also complex to implement requiring substantial
Univerisity of Southamtpon Higheld, Southampton
"... Recently recursive algorithm has been used in getting Fisher criterion based linear discriminants through which the features obtained are statistically uncorrelated. This paper investigates a simpler and faster approach to compute uncorrelated discriminants. This is done by rst mapping the input dat ..."
Abstract
 Add to MetaCart
Recently recursive algorithm has been used in getting Fisher criterion based linear discriminants through which the features obtained are statistically uncorrelated. This paper investigates a simpler and faster approach to compute uncorrelated discriminants. This is done by rst mapping the input
Results 1  10
of
68