Sciweavers

11214 search results - page 77 / 2243
» Just-in-time data structures
Sort
View
COMPGEOM
2010
ACM
14 years 3 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
IDEAL
2003
Springer
14 years 3 months ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo
ITNG
2007
IEEE
14 years 4 months ago
Super Iterator A design pattern for Algorithm and Data structure collections
The Super Iterator pattern, like the standard Iterator pattern, traverses an unknown data structure without exposing that structure. With the standard Iterator pattern, clients mu...
Andre Oboler, Charles Twardy, David W. Albrecht
APLAS
2010
ACM
13 years 10 months ago
Data Structure Fusion
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
CDC
2009
IEEE
111views Control Systems» more  CDC 2009»
14 years 2 months ago
Minimal dynamical structure realisations with application to network reconstruction from data
— Network reconstruction, i.e., obtaining network structure from data, is a central theme in systems biology, economics, and engineering. Previous work introduced dynamical struc...
Ye Yuan, Guy-Bart Vincent Stan, Sean Warnick, Jorg...