Results 11  20
of
865
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
Relaxed Fibonacci heaps: An alternative to Fibonacci heaps with worst case rather than amortized time bounds
, 1995
"... We present a new data structure called relaxed Fibonacci heaps for implementing priority queues on a RAM. Relaxed Fibonacci heaps support the operations find minimum, insert, decrease key and meld, each in O(1) worst case time and delete and delete min in O(log n) worst case time. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a new data structure called relaxed Fibonacci heaps for implementing priority queues on a RAM. Relaxed Fibonacci heaps support the operations find minimum, insert, decrease key and meld, each in O(1) worst case time and delete and delete min in O(log n) worst case time.
ViewDependent Refinement of Progressive Meshes
"... Levelofdetail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation defines for an arbitrary triangle mesh a sequence of approximating meshes optimized for viewindependent LOD. In this paper, ..."
Abstract

Cited by 459 (5 self)
 Add to MetaCart
and coarsening the mesh according to these criteria. The algorithm exploits view coherence, supports frame rate regulation, and is found to require less than 15 % of total frame time on a graphics workstation. Moreover, for continuous motions this work can be amortized over consecutive frames. In addition
Amortized Supersampling
"... We present a realtime rendering scheme that reuses shading samples from earlier time frames to achieve practical antialiasing of procedural shaders. Using a reprojection strategy, we maintain several sets of shading estimates at subpixel precision, and incrementally update these such that for most ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We present a realtime rendering scheme that reuses shading samples from earlier time frames to achieve practical antialiasing of procedural shaders. Using a reprojection strategy, we maintain several sets of shading estimates at subpixel precision, and incrementally update these such that for most
Amortized Complexity of Data Structures
, 1991
"... This thesis investigates the amortized complexity of some fundamental data structure problems and introduces interesting ideas for proving lower bounds on amortized complexity and for performing amortized analysis. The problems are as follows: ffl Dictionary Problem: A dictionary is a dynamic set t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
that supports searches of elements and changes under insertions and deletions of elements. It is open whether there exists a dictionary data structure that takes constant amortized time per operation and uses space polynomial in the dictionary size. We prove that dictionary operations require log
Multivariate Amortized Resource Analysis
, 2010
"... We study the problem of automatically analyzing the worstcase resource usage of procedures with several arguments. Existing automatic analyses based on amortization, or sized types bound the resource usage or result size of such a procedure by a sum of unary functions of the sizes of the arguments. ..."
Abstract

Cited by 47 (8 self)
 Add to MetaCart
We study the problem of automatically analyzing the worstcase resource usage of procedures with several arguments. Existing automatic analyses based on amortization, or sized types bound the resource usage or result size of such a procedure by a sum of unary functions of the sizes of the arguments
Amortizing Garbled Circuits
 Advances in Cryptology – CRYPTO 2014
"... Abstract. We consider secure twoparty computation in a multipleexecution setting, where two parties wish to securely evaluate the same circuit multiple times. We design efficient garbledcircuitbased twoparty protocols secure against malicious adversaries. Recent works by Lindell (Crypto 2013) a ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Abstract. We consider secure twoparty computation in a multipleexecution setting, where two parties wish to securely evaluate the same circuit multiple times. We design efficient garbledcircuitbased twoparty protocols secure against malicious adversaries. Recent works by Lindell (Crypto 2013
Practical Amortized Dynamic Indexing
"... The indexing problem is that of preprocessing a (very large) text T so that subsequent searches for patterns P can be accomplished in time O(jP j + tocc), where jP j is the pattern length and tocc is the number of occurrences of the pattern in the text. In the dynamic indexing problem the text ma ..."
Abstract
 Add to MetaCart
The indexing problem is that of preprocessing a (very large) text T so that subsequent searches for patterns P can be accomplished in time O(jP j + tocc), where jP j is the pattern length and tocc is the number of occurrences of the pattern in the text. In the dynamic indexing problem the text
Secure Computation with Sublinear Amortized Work
"... Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies a protocol with complexity at least linear in the input size. In fact, linear running time is inherent for secure computa ..."
Abstract
 Add to MetaCart
be utilized in the insecure setting; private database search is a prime example. We present an approach to secure twoparty computation that yields sublineartime protocols, in an amortized sense, for functions that can be computed in sublinear time on a random access machine (RAM). Furthermore, a party whose
On Amortizing Inference Cost for Structured Prediction
"... This paper deals with the problem of predicting structures in the context of NLP. Typically, in structured prediction, an inference procedure is applied to each example independently of the others. In this paper, we seek to optimize the time complexity of inference over entire datasets, rather than ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper deals with the problem of predicting structures in the context of NLP. Typically, in structured prediction, an inference procedure is applied to each example independently of the others. In this paper, we seek to optimize the time complexity of inference over entire datasets, rather than
Results 11  20
of
865