Sciweavers

2124 search results - page 203 / 425
» Repairing Structurally Complex Data
Sort
View
EUROPAR
2010
Springer
13 years 11 months ago
Generators-of-Generators Library with Optimization Capabilities in Fortress
Abstract. To resolve difficulties in parallel programming, a large number of studies are conducted on parallel skeletons and optimization theorems over skeleton programs. However, ...
Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Kimino...
APVIS
2010
13 years 5 months ago
Visual analysis of high dimensional point clouds using topological landscapes
In this paper, we present a novel three-stage process to visualize the structure of point clouds in arbitrary dimensions. To get insight into the structure and complexity of a dat...
Patrick Oesterling, Christian Heine, Heike Jä...
ICDE
2006
IEEE
185views Database» more  ICDE 2006»
14 years 4 months ago
Don't be a Pessimist: Use Snapshot based Concurrency Control for XML
Currently, only few XML data management systems support concurrent access to an XML document, and if they do, they typically apply variations of hierarchical locking to handle XML...
Zeeshan Sardar, Bettina Kemme
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
14 years 1 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams
COMGEO
2004
ACM
13 years 10 months ago
Expected time analysis for Delaunay point location
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
Luc Devroye, Christophe Lemaire, Jean-Michel Morea...