6756 search results - page 221 / 1352 » The Structure of Visual Spaces |
257
click to vote
COMPGEOM
2010
ACM
16 years 9 days ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
166
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
165
click to vote
GD
2007
Springer
16 years 1 months ago
2007
Springer
We propose a visualization approach for large dynamic graph structures with high degree variation and low diameter. In particular, we reduce visual complexity by multiple modes of ...
209
click to vote
INFOVIS
2002
IEEE
16 years 4 days ago
2002
IEEE
Beamtrees are a new method for the visualization of large hierarchical data sets. Nodes are shown as stacked circular beams, such that both the hierarchical structure as well as t...
197
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
Most existing methods of semi-supervised clustering introduce supervision from outside, e.g., manually label some data samples or introduce constrains into clustering results. Thi...