Sciweavers

2498 search results - page 42 / 500
» Data Structures with Unpredictable Timing
Sort
View
ICIP
1999
IEEE
15 years 11 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...
AVI
2008
15 years 1 days ago
Realizing the hidden: interactive visualization and analysis of large volumes of structured data
An emerging trend in Web computing aims at collecting and integrating distributed data. For instance, community driven efforts recently have build ontological repositories made of...
Olaf Noppens, Thorsten Liebig
CIDR
2011
188views Algorithms» more  CIDR 2011»
14 years 1 months ago
Managing Structured Collections of Community Data
Data management is becoming increasingly social. We observe a new form of information in such collaborative scenarios, where users contribute and reuse information, which resides ...
Wolfgang Gatterbauer, Dan Suciu
GCC
2007
Springer
15 years 3 months ago
Data Persistence in Structured P2P Networks with Redundancy Schemes
Data service is the principle application in structured P2P networks. And in many cases, we need the data to persist for a long time. So how to persist the data service and how lo...
Hongxing Li, Guihai Chen
PPOPP
2012
ACM
13 years 5 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank