Results 1  10
of
3,492
Lowcomplexity constant coefficient matrix multiplication using a minimum spanning tree approach
, 2004
"... In this paper a novel approach for realizing constant coefficient matrix multiplication using few additions and subtractions is proposed. This method is applicable in, e.g., FIR filter banks, transforms, and polyphase form FIR filters for sample rate changes. Examples show that the proposed method y ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
In this paper a novel approach for realizing constant coefficient matrix multiplication using few additions and subtractions is proposed. This method is applicable in, e.g., FIR filter banks, transforms, and polyphase form FIR filters for sample rate changes. Examples show that the proposed method
A distributed algorithm for minimumweight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract

Cited by 435 (3 self)
 Add to MetaCart
A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm
gSpan: GraphBased Substructure Pattern Mining
, 2002
"... We investigate new approaches for frequent graphbased pattern mining in graph datasets and propose a novel algorithm called gSpan (graphbased Substructure pattern mining) , which discovers frequent substructures without candidate generation. gSpan builds a new lexicographic order among graphs, and ..."
Abstract

Cited by 650 (34 self)
 Add to MetaCart
We investigate new approaches for frequent graphbased pattern mining in graph datasets and propose a novel algorithm called gSpan (graphbased Substructure pattern mining) , which discovers frequent substructures without candidate generation. gSpan builds a new lexicographic order among graphs
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
matching), improved from O(nm log0dn+2)n); (4) O(mj3(m, n)) for the minimum spanning tree problem, improved from O(mloglo&,,.+2,n), where j3(m, n) = min {i 1 log % 5 m/n). Note that B(m, n) 5 log*n if m 2 n. Of these results, the improved bound for minimum spanning trees is the most striking, although
On the topologies of local minimum spanning trees
 IN PROCEEDINGS OF THE 3RD WORKSHOP ON COMBINATORIAL AND ALGORITHMIC ASPECTS OF NETWORKING (CAAN’06
, 2006
"... This paper is devoted to study the combinatorial properties of Local Minimum Spanning Trees (LMSTs), a geometric structure that is attracting increasing research interest in the wireless sensor networks community. Namely, we study which topologies are allowed for a sensor network that uses, for supp ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, for supporting connectivity, a local minimum spanning tree approach. First, we refine the current definition of LMST realizability, focusing on the role of the power of transmission (i.e., of the radius of the covered area). Second, we show simple planar, connected, and trianglefree graphs with maximum degree 3
Mip Reconstruction Techniques And Minimum Spanning Tree Clustering,” SLACPUB11359 Contributed to
 2005 International Linear Collider Workshop (LCWS 2005
, 2005
"... The development of a tracking algorithm for minimum ionizing particles in the calorimeter and of a clustering algorithm based on the Minimum Spanning Tree approach are described. They do not depend on information from the central tracking system. Both are important components of a particle flow algo ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The development of a tracking algorithm for minimum ionizing particles in the calorimeter and of a clustering algorithm based on the Minimum Spanning Tree approach are described. They do not depend on information from the central tracking system. Both are important components of a particle flow
ZVMST: a minimum spanning treebased vertex finder
, 811
"... A new topological vertex finder is presented which combines ideas of the wellestablished ZVTOP algorithm with a novel minimum spanning tree approach. A preliminary performance study with simulated e + e − → q¯q events at a centre of mass energy of s = 92GeV shows that the new approach is competitiv ..."
Abstract
 Add to MetaCart
A new topological vertex finder is presented which combines ideas of the wellestablished ZVTOP algorithm with a novel minimum spanning tree approach. A preliminary performance study with simulated e + e − → q¯q events at a centre of mass energy of s = 92GeV shows that the new approach
Inferring decision trees using the minimum description length principle
, 1989
"... We explore the use of Rissanen’s minimum description length principle for the construction of decision trees. Empirical results comparing this approach to other methods are given. ..."
Abstract

Cited by 322 (7 self)
 Add to MetaCart
We explore the use of Rissanen’s minimum description length principle for the construction of decision trees. Empirical results comparing this approach to other methods are given.
A general approximation technique for constrained forest problems
 SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract

Cited by 414 (21 self)
 Add to MetaCart
problems fit in this framework, including the shortest path, minimumcost spanning tree, minimumweight perfect matching, traveling salesman, and Steiner tree problems. Our technique produces approximation algorithms that run in O(n log n) time and come within a factor of 2 of optimal for most
A Data Structure for Dynamic Trees
, 1983
"... A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n) ti ..."
Abstract

Cited by 347 (21 self)
 Add to MetaCart
) time. Using this data structure, new fast algorithms are obtained for the following problems: (1) Computing nearest common ancestors. (2) Solving various network flow problems including finding maximum flows, blocking flows, and acyclic flows. (3) Computing certain kinds of constrained minimum spanning
Results 1  10
of
3,492