Results 1  10
of
302
Typebased data structure verification
 In PLDI
, 2009
"... We present a refinement typebased approach for the static verification of complex data structure invariants. Our approach is based on the observation that complex data structures are typically fashioned from two elements: recursion (e.g., lists and trees), and maps (e.g., arrays and hash tables). W ..."
Abstract

Cited by 21 (7 self)
 Add to MetaCart
We present a refinement typebased approach for the static verification of complex data structure invariants. Our approach is based on the observation that complex data structures are typically fashioned from two elements: recursion (e.g., lists and trees), and maps (e.g., arrays and hash tables
An Optimal Algorithm for Closest Pair Maintenance
 Discrete Comput. Geom
, 1995
"... Given a set S of n points in kdimensional space, and an L t metric, the dynamic closest pair problem is defined as follows: find a closest pair of S after each update of S (the insertion or the deletion of a point). For fixed dimension k and fixed metric L t , we give a data structure of size O(n) ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
Given a set S of n points in kdimensional space, and an L t metric, the dynamic closest pair problem is defined as follows: find a closest pair of S after each update of S (the insertion or the deletion of a point). For fixed dimension k and fixed metric L t , we give a data structure of size O
ClosestPoint Problems in Computational Geometry
, 1997
"... This is the preliminary version of a chapter that will appear in the Handbook on Computational Geometry, edited by J.R. Sack and J. Urrutia. A comprehensive overview is given of algorithms and data structures for proximity problems on point sets in IR D . In particular, the closest pair problem, th ..."
Abstract

Cited by 73 (14 self)
 Add to MetaCart
This is the preliminary version of a chapter that will appear in the Handbook on Computational Geometry, edited by J.R. Sack and J. Urrutia. A comprehensive overview is given of algorithms and data structures for proximity problems on point sets in IR D . In particular, the closest pair problem
Uncertainty in surfacefire history: the case of ponderosa pine forests in the western United States.
 Can. J. Forest Res.
, 2001
"... Abstract: Present understanding of fire ecology in forests subject to surface fires is based on firescar evidence. We present theory and empirical results that suggest that firehistory data have uncertainties and biases when used to estimate the population mean fire interval (FI) or other paramet ..."
Abstract

Cited by 61 (1 self)
 Add to MetaCart
FI calculations. Finally, inadequate sampling and targeting of multiplescarred trees and high scar densities bias mean FIs toward shorter intervals. In ponderosa pine (Pinus ponderosa Dougl. ex P. & C. Laws.) forests of the western United States, these uncertainties and biases suggest that reported mean FIs
Programs with Recursively Defined Data Structures Using Pointers
, 1998
"... Debugging of Programs with Treelike Data Structures is Model Checking of Pushdown Systems 12:1013:50 Lunch 13:5014:35 Shai Rubin: Virtual Cache Line: A New Technique to Improve Cache Exploitation for Recursive Data Structures 14:3515:35 Trishul Chilimbi: CacheConscious Data Structures 15 ..."
Abstract
 Add to MetaCart
Debugging of Programs with Treelike Data Structures is Model Checking of Pushdown Systems 12:1013:50 Lunch 13:5014:35 Shai Rubin: Virtual Cache Line: A New Technique to Improve Cache Exploitation for Recursive Data Structures 14:3515:35 Trishul Chilimbi: CacheConscious Data Structures
Optimizing Crops for Biocontrol of Pests and Disease
"... Volatile compounds and extrafloral nectar are common defenses of wild plants; however, in crops they bear an asyet underused potential for biological control of pests and diseases. Odor emission and nectar secretion are multigene traits in wild plants, and thus form difficult targets for breeding. ..."
Abstract
 Add to MetaCart
to enhance repellence of aphids and attract aphid carnivores). We highlight the major defensive functions of VOCs and EFN, discuss why VOCs and EFN are rarely included in breeding programs, and propose how and to what degree these traits can be optimized to allow better biological control of pests and crop
BetrFS: A RightOptimized WriteOptimized File System
"... The Bεtree File System, or BetrFS, (pronounced “better eff ess”) is the first inkernel file system to use a writeoptimized index. Write optimized indexes (WOIs) are promising building blocks for storage systems because of their potential to implement both microwrites and large scans efficiently. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
, and requires additional datastructure tuning to match current generalpurpose file systems on some operations such as deletes, directory renames, and large sequential writes. Nonetheless, many applications realize significant performance improvements. For instance, an inplace rsync of the Linux kernel
Window QueryOptimal Clustering of Spatial Objects
"... During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result, e.g. an optimal spatial data clustering, which would allow for the absolute comparison of the performance of the wellkn ..."
Abstract
 Add to MetaCart
, whereas for cb 3 it is NPhard. In experiments using simulated annealing heuristics for the optimization the best dynamic structures as well as the static packed Rtree perform about 20 % worse than the optimum on average. However, we again want to emphazise that we understand our contribution as lower
Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions
, 1995
"... We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and deletions, in amortized time O(n 1/2 log 2 n) per update operation. We reduce the problem to maintaining bichromatic closest pairs, which we solve in time O(n # ) per update. Our algorithm uses a novel ..."
Abstract

Cited by 38 (3 self)
 Add to MetaCart
data structure is one that maintains the solution to some problem, defined on a geometric input such as a point set, as the input undergoes update operations such as insertions or deletions of single points. Dynamic algorithms have been studied for many geometric optimization problems, including
Results 1  10
of
302