804 search results - page 35 / 161 » Experiments on Union-Find Algorithms for the Disjoint-Set Da... |
ADC
2008
Springer
14 years 2 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
GMP
2008
IEEE
14 years 2 months ago
2008
IEEE
We propose a method to identify planar regions in volume data using a specialized version of the discrete Radon transform operating on a structured or unstructured grid. The algori...
ISBI
2002
IEEE
14 years 8 months ago
2002
IEEE
Conventional deformable registration methods are mostly driven by the interface between different brain structures. In recent years, Diffusion Tensor Magnetic Resonance Imaging (D...
SDM
2011
SIAM
12 years 10 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
BMCBI
2006
13 years 7 months ago
2006
Background: A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics,...