Results 1  10
of
354
Interprocedural dataflow analysis via graph reachability
, 1994
"... The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract

Cited by 454 (34 self)
 Add to MetaCart
The paper shows how a large class of interprocedural dataflowanalysis problems can be solved precisely in polynomial time by transforming them into a special kind of graphreachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow
Efficiency of a Good But Not Linear Set Union Algorithm
, 1975
"... Two types of instructmns for mampulating a family of disjoint sets which partitmn a umverse of n elements are considered FIND(x) computes the name of the (unique) set containing element x UNION(A, B, C) combines sets A and B into a new set named C. A known algorithm for implementing sequences of the ..."
Abstract

Cited by 321 (15 self)
 Add to MetaCart
of these mstructmns is examined It is shown that, if t(m, n) as the maximum time reqmred by a sequence of m> n FINDs and n 1 intermixed UNIONs, then kima(m, n) _~ t(m, n) < k:ma(m, n) for some positive constants ki and k2, where a(m, n) is related to a functional inverse of Ackermann's functmn
A Simple and Efficient UnionFindDelete Algorithm
, 2010
"... The UnionFind data structure for maintaning disjoint sets is one of the best known and widespread data structures, in particular the version with constanttime Union and efficient Find. Recently, the question of how to handle deletions from the structure in an efficient manner has been taken up, fi ..."
Abstract
 Add to MetaCart
The UnionFind data structure for maintaning disjoint sets is one of the best known and widespread data structures, in particular the version with constanttime Union and efficient Find. Recently, the question of how to handle deletions from the structure in an efficient manner has been taken up
Topics over time: A nonMarkov continuoustime model of topical trends
 in SIGKDD
, 2006
"... This paper presents an LDAstyle topic model that captures not only the lowdimensional structure of data, but also how the structure changes over time. Unlike other recent work that relies on Markov assumptions or discretization of time, here each topic is associated with a continuous distribution ..."
Abstract

Cited by 251 (10 self)
 Add to MetaCart
time. We present results on nine months of personal email, 17 years of NIPS research papers and over 200 years of presidential stateoftheunion addresses, showing improved topics, better timestamp prediction, and interpretable trends.
UnionFind with Constant Time Deletions
"... A unionfind data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for an extension of the unionfind problem in which elements of the sets maintained may be deleted. The cost of a delete opera ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
structure that supports delete, aswell as makeset and union, operations in constant time, while still supporting find operations in O(log n) worstcase time and O(α(n)) amortized time, where n is the number of elements in the set returned by the find operation, and α(n) is a functional inverse of Ackermann
Adaptive Set Intersections, Unions, and Differences
 In Proceedings of the 11th Annual ACMSIAM Symposium on Discrete Algorithms (SODA
, 2000
"... Motivated by boolean queries in text database systems, we consider the problems of finding the intersection, union, or difference of a collection of sorted sets. While the worstcase complexity of these problems is straightforward, we consider a notion of complexity that depends on the particular in ..."
Abstract

Cited by 88 (9 self)
 Add to MetaCart
instance. We develop the idea of a proof that a given set is indeed the correct answer. Proofs, and in particular shortest proofs, are characterized. We present adaptive algorithms that make no a priori assumptions about the problem instance, and show that their running times are within a constant factor
Minimum energy mobile wireless networks revisited
 In IEEE International Conference on Communications (ICC
, 2001
"... Energy conservation is a critical issue in designing wireless ad hoc networks, as the nodes are powered by batteries only. Given a set of wireless network nodes, the directed weighted transmission graph Gt has an edge uv if and only if node v is in the transmission range of node u and the weight of ..."
Abstract

Cited by 170 (6 self)
 Add to MetaCart
of uv is typically defined as II,,vll + c for a constant 2 <_ t ~ < 5 and c> O. The minimum power topology Gm is the smallest subgraph of Gt that contains the shortest paths between all pairs of nodes, i.e., the union of all shortest paths. In this paper, we described a distributed position
Searching in Constant Time and Minimum Space
, 1995
"... This report deals with techniques for minimal space representation of a subset of elements from a bounded universe so that various types of searches can be performed in constant time. In particular, we introduce a data structure to represent a subset of N elements of [0�:::�M;1] in a number of bits ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
requires M 2 + o(M 2) bits. Finally, under a byte overlap model of memory we present an M + o(M) bit, constant time solution to the dynamic onedimensional closest neighbour problem (hence, also unionsplitfind and priority queue problems) on [0�:::�M; 1].
A LinearTime Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study
 Journal of Computational Biology
, 2001
"... Hannenhalli and Pevzner gave the first polynomialtime algorithm for computing the inversion distance between two signed permutations, as part of the larger task of determining the shortest sequence of inversions needed to transform one permutation into the other. Their algorithm (restricted to dist ..."
Abstract

Cited by 151 (15 self)
 Add to MetaCart
of the overlap graph and gave an O(n alpha(n)) algorithm, based on a UnionFind structure, to find its connected components, where a is the inverse Ackerman function. Since for all practical purposes alpha(n) is a constant no larger than four, this algorithm has been the fastest practical algorithm to date
in the European Union
, 2011
"... 1 This paper aims to examine the Competitiveness of China and India in the European Union based on the international trade values, during the time period 20012009. It firstly reflects about the ambiguous definition of Competitiveness as well as the diversity of methods that exist to measure this co ..."
Abstract
 Add to MetaCart
1 This paper aims to examine the Competitiveness of China and India in the European Union based on the international trade values, during the time period 20012009. It firstly reflects about the ambiguous definition of Competitiveness as well as the diversity of methods that exist to measure
Results 1  10
of
354