Filters








1,685 Hits in 4.4 sec

On the bounded-skew clock and Steiner routing problems

Dennis J. H. Huang, Andrew B. Kahng, Chung-Wen Albert Tsao
1995 Proceedings of the 32nd ACM/IEEE conference on Design automation conference - DAC '95  
We study the minimum-cost bounded-skewrouting tree (BST) problem under the linear delay model.  ...  Our work provides unifications of the clock routing and Steiner tree heuristic literatures and gives smooth cost-skew tradeoff that enable good engineering solutions.  ...  of edge-overlapping from a minimum spanning tree in the limit B = 1.  ... 
doi:10.1145/217474.217579 dblp:conf/dac/HuangKT95 fatcat:ycpwtt6qgnan7fv3azfatsxj6u

On the Bounded-Skew Clock and Steiner Routing Problems

Dennis J.-H. Huang
1995 Proceedings - Design Automation Conference  
We study the minimum-cost bounded-skewrouting tree (BST) problem under the linear delay model.  ...  Our work provides unifications of the clock routing and Steiner tree heuristic literatures and gives smooth cost-skew tradeoff that enable good engineering solutions.  ...  of edge-overlapping from a minimum spanning tree in the limit B = 1.  ... 
doi:10.1109/dac.1995.250000 fatcat:puucwfuoybftndnd3osdoxpaym

Scalable parallel minimum spanning forest computation

Sadegh Nobari, Thanh-Tung Cao, Panagiotis Karras, Stéphane Bressan
2012 SIGPLAN notices  
One such problem is the computation of a graph's minimum spanning forest (MSF).  ...  Our algorithm leverages Prim's algorithm in a parallel fashion, concurrently expanding several subsets of the computed MSF.  ...  The Minimum Spanning Tree (MST) problem calls to find a spanning tree of a weighted connected graph G having the minimum total weight [17] .  ... 
doi:10.1145/2370036.2145842 fatcat:qis5qbxekjduni37q5xsyevhra

Scalable parallel minimum spanning forest computation

Sadegh Nobari, Thanh-Tung Cao, Panagiotis Karras, Stéphane Bressan
2012 Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming - PPoPP '12  
One such problem is the computation of a graph's minimum spanning forest (MSF).  ...  Our algorithm leverages Prim's algorithm in a parallel fashion, concurrently expanding several subsets of the computed MSF.  ...  The Minimum Spanning Tree (MST) problem calls to find a spanning tree of a weighted connected graph G having the minimum total weight [17] .  ... 
doi:10.1145/2145816.2145842 dblp:conf/ppopp/NobariCKB12 fatcat:tyzqrjvydncbfdsyu32bojmoii

Efficient evaluation of n-ary conjunctive queries over trees and graphs

François Bry, Tim Furche, Benedikt Linse, Andreas Schroeder
2006 Proceedings of the eighth ACM international workshop on Web information and data management - WIDM '06  
Despite a considerable body of research on the optimization of such queries over tree-shaped XML data, little attention has been paid so far to efficient access to graph-shaped XML, RDF, or Topic Maps.  ...  For each of population and consumption, we propose two resp. three algorithms each having their own advantages. The complexity of the algorithms is compared analytically and experimentally.  ...  likely to give interesting results: First of all, there are extensions of the top-down matching algorithm to a complete unification algorithm, as needed in Xcerpt [12] .  ... 
doi:10.1145/1183550.1183555 dblp:conf/widm/BryFLS06 fatcat:3svxmjuvwfe7thly2pv3f43gza

Relevance Matters: Capitalizing on Less (Top-k Matching in Publish/Subscribe)

Mohammad Sadoghi, Hans-Arno Jacobsen
2012 2012 IEEE 28th International Conference on Data Engineering  
At the core of BE*-Tree lie two innovative ideas: (1) a bidirectional tree expansion build as a top-down (data and space clustering) and a bottom-up growths (space clustering), which together enable indexing  ...  cost of processing millions of patterns.  ...  TOP-K PROCESSING Our top-k algorithm is a two-stage process in which, on the one hand, a cost-based tree traversal is utilized to determine which p-node in BE*-Tree to visit next, and, on the other hand  ... 
doi:10.1109/icde.2012.38 dblp:conf/icde/SadoghiJ12 fatcat:nzt236ufv5drfpeubtklphvy7m

Dynamic 2-Connectivity with Backtracking

Johannes A. La Poutré, Jeffery Westbrook
1998 SIAM journal on computing (Print)  
We give algorithms and data structures that maintain the 2-edge and 2-vertexconnected components of a graph under insertions and deletions of edges and vertices, where deletions occur in a backtracking  ...  Our algorithms run in Θ(log n) worst-case time per operation and use Θ(n) space, where n is the number of vertices.  ...  We anticipate that our algorithms herein provide a basis for efficient solutions of these problems. Lemma 4 . 1 . 41 Let T be a spanning tree of graph G.  ... 
doi:10.1137/s0097539794272582 fatcat:cknmiwpbezhmbm4s2mjb5yk6ky

Balancing Robustness and Efficiency in Unification-Augmented Context-Free Parsers for Large Practical Applications [chapter]

Carolyn Penstein Rosé, Alon Lavie
2001 Text, Speech and Language Technology  
unification-augmented context-free grammar formalism.  ...  The effectiveness and efficiency of any robust parser are a direct function of three main factors: (1) Flexibility: what types of disfluencies and deviations from the grammar can the parser handle?  ...  Thus, when insertions are enabled, top-down predictions are computed with a modified version of the left-corner relation that is computed not only between the left hand side category of a rule and the  ... 
doi:10.1007/978-94-015-9719-7_10 fatcat:pkwmblacuvc2dd5x265cpswsrq

Wrap&Zip decompression of the connectivity of triangle meshes compressed with Edgebreaker

Jarek Rossignac, Andrzej Szymczak
1999 Computational geometry  
Wrap&Zip reads the CLERS string and builds a triangle treea triangulated, simply connected, topological polygon without interior vertices.  ...  The main contribution reported here is a simpler and efficient decompression algorithm, called Wrap&Zip, which has a linear time and space complexity.  ...  Spiraling triangle-spanning tree The Edgebreaker compression algorithm visits the triangles of the mesh in the order in which they appear in a spiraling triangle-spanning tree.  ... 
doi:10.1016/s0925-7721(99)00028-0 fatcat:4q5dipan2beazippjhce7ggyje

Control and optimization strategies in the implementation of LDL

R. Krishnamurthy, Carlo Zaniolo
1990 Advances in database programming languages  
to select a minimum cost execution in such a space.  ...  A relational system uses knowledge of storage structures, information about database statistics, and various estimates to predict the cost of execution schemes chosen from a predefined search space and  ...  In order to avoid optimizing a subtree with a binding pattern that may never be used, a top-down algorithm has been devised and is reported in Krishnamurthy and Zaniolo [1988] .  ... 
doi:10.1145/101620.101640 dblp:conf/dbpl/KrishnamurthyZ87 fatcat:qp7y42ynzbfcdjoivqpu6e6uru

Efficiency, robustness and accuracy in Picky chart parsing

David M. Magerman, Carl Weir
1992 Proceedings of the 30th annual meeting on Association for Computational Linguistics -  
Using a suboptimal search method, "Picky significantly reduces the number of edges produced by CKY-like chart parsing algorithms, while maintaining the robustness of pure bottom-up parsers and the accuracy  ...  This paper describes Picky, a probabilistic agenda-based chart parsing algorithm which uses a technique called p~'obabilistic prediction to predict which grammar rules are likely to lead to an acceptable  ...  Picky combines the standard chart parsing data structures with existing bottom-up and top-down parsing operations, and includes a probabilistic version of top-down filtering and over-the-top prediction  ... 
doi:10.3115/981967.981973 dblp:conf/acl/MagermanW92 fatcat:2nhiullkqbcsrj3lwgzogbqavy

The Log-Interleave Bound: Towards the Unification of Sorting and the BST Model [article]

Guy Blelloch, Magdalen Dobson
2021 arXiv   pre-print
The final result is a mergesort algorithm which performs work within the log-interleave bound of a permutation π.  ...  The technique used to design this algorithm also serves as a general way to show whether a sorting algorithm can be transformed into an offline BST algorithm.  ...  Our merge has the same span as Blelloch et al's union algorithm, which they proved in [5] to have span 𝑂 (lg 2 𝑛) when merging two trees of size 𝑛.  ... 
arXiv:2110.11836v1 fatcat:35gxjymfkvdl7ncs7oodffzl5i

A reciprocal framework for spatial K-anonymity

Gabriel Ghinita, Keliang Zhao, Dimitris Papadias, Panos Kalnis
2010 Information Systems  
., construction cost). Then, we present case studies of applying our framework on top of two popular spatial indices (namely, R*-trees and Quad-trees).  ...  In contrast, we propose a general framework for implementing reciprocal algorithms using any existing spatial index on the user locations.  ...  Return compute-ASR(U, N') Fig. 4.5 Asymmetric R-tree Split (AR) While bottom-up traversal considers the cardinality of all nodes at a level, top-down only considers the cardinalities at a single  ... 
doi:10.1016/j.is.2009.10.001 fatcat:4amn7w4vvfetjiiaz4fx5mqm2y

A*-tree

Tingjian Ge, Stan Zdonik
2010 Proceedings of the VLDB Endowment  
We analyze and experimentally verify the accuracy of an A*-tree encoding of the underlying joint distribution.  ...  We devise a novel data structure, called the A*-tree (multidimensional Array tree), demonstrating that by taking advantage of the predictable and structured correlations of multidimensional data, we can  ...  Tingjian Ge was supported in part by the starup funding from the Department of Computer Science at the University of Kentucky. Stan Zdonik  ... 
doi:10.14778/1920841.1920963 fatcat:5sbbhh6idzg7hdrcchmzzrcnu4

Linguistic approaches to biological sequences

David B. Searls
1997 Bioinformatics  
However, a metaphor is not a tool, and it is necessary to ask whether the techniques used in analyzing other kinds of languages, such as human and computer languages, can in fact be of any use in tackling  ...  This paper reviews the work of the author and others in applying the methods of computational linguistics to biological sequences.  ...  Acknowledgement This work was supported by the Department of Energy. Office of Energy Research, under grant number ER6I371.  ... 
doi:10.1093/bioinformatics/13.4.333 fatcat:rkjris7vivgtzf2sobqthyr774
« Previous Showing results 1 — 15 out of 1,685 results