Sciweavers

489 search results - page 70 / 98
» A Method for Accelerating the HITS Algorithm
Sort
View
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 8 months ago
Dynamic hybrid clustering of bioinformatics by incorporating text mining and citation analysis
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...
Bart De Moor, Frizo A. L. Janssens, Wolfgang Gl&au...
SIGGRAPH
1998
ACM
13 years 12 months ago
Visibility Sorting and Compositing Without Splitting for Image Layer Decompositions
We present an efficient algorithm for visibility sorting a set of moving geometric objects into a sequence of image layers which are composited to produce the final image. Inste...
John M. Snyder, Jed Lengyel
SIGGRAPH
1993
ACM
13 years 11 months ago
Hierarchical Z-buffer visibility
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...
Ned Greene, Michael Kass, Gavin S. P. Miller
RT
1998
Springer
13 years 12 months ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion
ISBI
2008
IEEE
14 years 8 months ago
Multi-resolution parallel integral projection for fast localization of a straight electrode in 3D ultrasound images
We address the problem of fast and accurate localization of miniature surgical instruments like needles or electrodes using 3D ultrasound (US). An algorithm based on maximizing a ...
Christian Cachard, Hervé Liebgott, Jan Kybi...