Sciweavers

2656 search results - page 313 / 532
» Compacting XML Data
Sort
View
143
Voted
ACSC
2004
IEEE
15 years 7 months ago
Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarch...
Carsten Friedrich, Falk Schreiber
151
Voted
SDM
2007
SIAM
130views Data Mining» more  SDM 2007»
15 years 5 months ago
Maximizing the Area under the ROC Curve with Decision Lists and Rule Sets
Decision lists (or ordered rule sets) have two attractive properties compared to unordered rule sets: they require a simpler classification procedure and they allow for a more co...
Henrik Boström
132
Voted
GIS
2008
ACM
15 years 4 months ago
Sparse terrain pyramids
Bintrees based on longest edge bisection and hierarchies of diamonds are popular multiresolution techniques on regularly sampled terrain datasets. In this work, we consider sparse...
Kenneth Weiss, Leila De Floriani
151
Voted
AAECC
2007
Springer
111views Algorithms» more  AAECC 2007»
15 years 3 months ago
When cache blocking of sparse matrix vector multiply works and why
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
Rajesh Nishtala, Richard W. Vuduc, James Demmel, K...
276
Voted
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 6 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...