Sciweavers

526 search results - page 68 / 106
» Representations of structural closure operators
Sort
View
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
15 years 3 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
ASPLOS
2011
ACM
14 years 3 months ago
NV-Heaps: making persistent objects fast and safe with next-generation, non-volatile memories
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
Joel Coburn, Adrian M. Caulfield, Ameen Akel, Laur...
WMPI
2004
ACM
15 years 5 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
CCCG
1998
15 years 1 months ago
Dynamic maintenance and visualization of molecular surfaces
Molecular surface computations are often necessary in order to perform synthetic drug design. A critical step in this process is the computation and update of an exact boundary re...
Chandrajit L. Bajaj, Valerio Pascucci, Robert J. H...
NIPS
2001
15 years 1 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi