Sciweavers

895 search results - page 19 / 179
» Using graphs for some discrete tomography problems
Sort
View
NIPS
2003
13 years 8 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
IWPEC
2004
Springer
14 years 23 days ago
Online Problems, Pathwidth, and Persistence
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
Rodney G. Downey, Catherine McCartin
JMIV
2008
214views more  JMIV 2008»
13 years 7 months ago
A Network Flow Algorithm for Reconstructing Binary Images from Continuous X-rays
Tomography is a powerful technique to obtain accurate images of the interior of an object in a nondestructive way. Conventional reconstruction algorithms, such as filtered backproj...
Kees Joost Batenburg
BMCBI
2010
214views more  BMCBI 2010»
13 years 7 months ago
AutoSOME: a clustering method for identifying gene expression modules without prior knowledge of cluster number
Background: Clustering the information content of large high-dimensional gene expression datasets has widespread application in "omics" biology. Unfortunately, the under...
Aaron M. Newman, James B. Cooper
CVGIP
2000
124views more  CVGIP 2000»
13 years 7 months ago
Hierarchical Solutions for the Deformable Surface Problem in Visualization
In this paper we present a hierarchical approach for the deformable surface technique. This technique is a three dimensional extension of the snake segmentation method. We use it ...
Christoph Lürig, Leif Kobbelt, Thomas Ertl