1521 search results - page 31 / 305 » The Stardinates - Visualizing Highly Structured Data |
113
click to vote
PAKDD
2009
ACM
15 years 8 months ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
134
click to vote
MICRO
2009
IEEE
15 years 8 months ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
117
click to vote
PLDI
2010
ACM
15 years 7 months ago
2010
ACM
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
165
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
109
click to vote
ICNP
2007
IEEE
15 years 8 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...