Results 1  10
of
457,132
Selfadjusting binary search trees
, 1985
"... The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have an am ..."
Abstract

Cited by 432 (18 self)
 Add to MetaCart
an amortized time bound of O(log n) per operation, where by “amortized time ” is meant the time per operation averaged over a worstcase sequence of operations. Thus splay trees are as efficient as balanced trees when total running time is the measure of interest. In addition, for sufficiently long access
Application of Phylogenetic Networks in Evolutionary Studies
 SUBMITTED TO MBE 2005
, 2005
"... The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when evoluti ..."
Abstract

Cited by 887 (15 self)
 Add to MetaCart
evolution proceeds in a treelike manner, analysis of the data may not be best served by using methods that enforce a tree structure, but rather by a richer visualization of the data to evaluate its properties, at least as an essential first step. Thus, phylogenetic networks should be employed when
A Simple, Fast, and Accurate Algorithm to Estimate Large Phylogenies by Maximum Likelihood
, 2003
"... The increase in the number of large data sets and the complexity of current probabilistic sequence evolution models necessitates fast and reliable phylogeny reconstruction methods. We describe a new approach, based on the maximumlikelihood principle, which clearly satisfies these requirements. The ..."
Abstract

Cited by 2182 (27 self)
 Add to MetaCart
. The core of this method is a simple hillclimbing algorithm that adjusts tree topology and branch lengths simultaneously. This algorithm starts from an initial tree built by a fast distancebased method and modifies this tree to improve its likelihood at each iteration. Due to this simultaneous adjustment
Efficient similarity search in sequence databases
, 1994
"... We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong. Anot ..."
Abstract

Cited by 515 (19 self)
 Add to MetaCart
. Another important observation is Parseval's theorem, which specifies that the Fourier transform preserves the Euclidean distance in the time or frequency domain. Having thus mapped sequences to a lowerdimensionality space by using only the first few Fourier coe cients, we use Rtrees to index
CIL: Intermediate language and tools for analysis and transformation of C programs
 In International Conference on Compiler Construction
, 2002
"... Abstract. This paper describes the CIntermediate Language: a highlevel representation along with a set of tools that permit easy analysis and sourcetosource transformation of C programs. Compared to C, CIL has fewer constructs. It breaks down certain complicated constructs of C into simpler ones, ..."
Abstract

Cited by 533 (11 self)
 Add to MetaCart
, and thus it works at a lower level than abstractsyntax trees. But CIL is also more highlevel than typical intermediate languages (e.g., threeaddress code) designed for compilation. As a result, what we have is a representation that makes it easy to analyze and manipulate C programs, and emit them in a
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
. For each experimental run, we first gen erated random CPTs. We then sampled from the joint distribution defined by the network and clamped the observed nodes (all nodes in the bottom layer) to their sampled value. Given a structure and observations, we then ran three inference algorithms junction tree
Distance Browsing in Spatial Databases
, 1999
"... Two different techniques of browsing through a collection of spatial objects stored in an Rtree spatial data structure on the basis of their distances from an arbitrary spatial query object are compared. The conventional approach is one that makes use of a knearest neighbor algorithm where k is kn ..."
Abstract

Cited by 390 (21 self)
 Add to MetaCart
Two different techniques of browsing through a collection of spatial objects stored in an Rtree spatial data structure on the basis of their distances from an arbitrary spatial query object are compared. The conventional approach is one that makes use of a knearest neighbor algorithm where k
Cryptanalysis of splay tree based encryption
"... Abstract. We present a chosenplaintext attack on KIST, a recently proposed encryption scheme based on splay trees. Our attack recovers a 128bit key with approximately 2 28 bit operations and fewer than 2 19 chosenplaintext queries. Splay trees are a type of binary search search trees discovered b ..."
Abstract
 Add to MetaCart
Abstract. We present a chosenplaintext attack on KIST, a recently proposed encryption scheme based on splay trees. Our attack recovers a 128bit key with approximately 2 28 bit operations and fewer than 2 19 chosenplaintext queries. Splay trees are a type of binary search search trees discovered
Applying the Interleave Bound to Splay Trees
"... Version 0.1, 2005/04/13 We give a discussion of the Interleave Bound for dynamic optimal binary search, along with some new properties and results. We attempt to apply these results to Splay Trees, in the hope of working towards a proof that splay trees are O(lg lg n)competitive. Some partial resul ..."
Abstract
 Add to MetaCart
Version 0.1, 2005/04/13 We give a discussion of the Interleave Bound for dynamic optimal binary search, along with some new properties and results. We attempt to apply these results to Splay Trees, in the hope of working towards a proof that splay trees are O(lg lg n)competitive. Some partial
Concurrent Search Tree by Lazy Splaying
"... In many search tree (maps) applications the distribution of items accesses is nonuniform, with some popular items accessed more frequently than others. Traditional selfadjusting tree algorithms adapt to the access pattern, but are not suitable for a concurrent setting since they constantly move it ..."
Abstract
 Add to MetaCart
items to the tree’s root, turning the root into a sequential hot spot. Here we present lazy splaying, a new search tree algorithm that moves frequently accessed items close to the root without making the root a bottleneck. Lazy splaying is fast and highly scalable making at most one local adjustment
Results 1  10
of
457,132