Sciweavers

11219 search results - page 59 / 2244
» Retroactive data structures
Sort
View
DRM
2007
Springer
15 years 4 months ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....
BMCBI
2008
102views more  BMCBI 2008»
14 years 10 months ago
Combining sequence-based prediction methods and circular dichroism and infrared spectroscopic data to improve protein secondary
Background: A number of sequence-based methods exist for protein secondary structure prediction. Protein secondary structures can also be determined experimentally from circular d...
Jonathan G. Lees, Robert W. Janes
COMPGEOM
2010
ACM
15 years 2 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
15 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
15 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