Sciweavers

307 search results - page 19 / 62
» A Structure for Modern Computer Narratives
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
HPCC
2005
Springer
14 years 1 months ago
Fast Sparse Matrix-Vector Multiplication by Exploiting Variable Block Structure
Abstract. We improve the performance of sparse matrix-vector multiplication (SpMV) on modern cache-based superscalar machines when the matrix structure consists of multiple, irregu...
Richard W. Vuduc, Hyun-Jin Moon
DEXAW
1999
IEEE
119views Database» more  DEXAW 1999»
13 years 12 months ago
Structure-Based Similarity Search with Graph Histograms
Objects like road networks, CAD/CAM components, electrical or electronic circuits, molecules, can be represented as graphs, in many modern applications. In this paper, we propose ...
Apostolos Papadopoulos, Yannis Manolopoulos
CVPR
2010
IEEE
14 years 3 months ago
Probabilistic Temporal Inference on Reconstructed 3D Scenes
Modern structure from motion techniques are capable of building city-scale 3D reconstructions from large image collections, but have mostly ignored the problem of largescale struc...
Grant Schindler, Frank Dellaert
SC
2004
ACM
14 years 29 days ago
The Potential of Computation Regrouping for Improving Locality
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
Chen Ding, Maksim Orlovich