Sciweavers

5746 search results - page 282 / 1150
» Visualizing Query Structure
Sort
View
ECCV
2010
Springer
15 years 9 months ago
Optimum Subspace Learning and Error Correction for Tensors
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
VDA
2010
200views Visualization» more  VDA 2010»
15 years 9 months ago
Operator-centric design patterns for information visualization software
Design patterns have proven to be a useful means to make the process of designing, developing, and reusing software systems more efficient. In the area of information visualizatio...
Zaixian Xie, Zhenyu Guo, Matthew O. Ward, Elke A. ...
ICDT
2012
ACM
293views Database» more  ICDT 2012»
13 years 9 months ago
On the complexity of query answering over incomplete XML documents
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
Amélie Gheerbrant, Leonid Libkin, Tony Tan
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 8 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch
JGTOOLS
2008
100views more  JGTOOLS 2008»
15 years 6 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...