316 search results - page 40 / 64 » Bounded Depth Data Trees |
DRM
2007
Springer
14 years 3 months ago
2007
Springer
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...
VVS
1996
IEEE
14 years 1 months ago
1996
IEEE
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a d...
JPDC
2006
13 years 9 months ago
2006
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
IPSN
2005
Springer
14 years 2 months ago
2005
Springer
— We consider a sensor network measuring correlated data, where the task is to gather all data from the network nodes to a sink. We consider the case where data at nodes is lossy...