Sciweavers

1012 search results - page 18 / 203
» Segment intersection searching problems in general settings
Sort
View
COMPGEOM
2003
ACM
14 years 3 months ago
the asteroid surveying problem and other puzzles
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
ISBI
2011
IEEE
13 years 1 months ago
Hippocampus segmentation using a stable maximum likelihood classifier ensemble algorithm
We develop a new algorithm to segment the hippocampus from MR images. Our method uses a new classifier ensemble algorithm to correct segmentation errors produced by a multi-atlas...
Hongzhi Wang, Jung Wook Suh, Sandhitsu R. Das, Mur...
COMPGEOM
2010
ACM
14 years 2 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
ICML
2005
IEEE
14 years 10 months ago
A practical generalization of Fourier-based learning
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate...
Adam Drake, Dan Ventura
IPMI
2005
Springer
14 years 10 months ago
Simultaneous Segmentation of Multiple Closed Surfaces Using Optimal Graph Searching
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
Kang Li, Steven Millington, Xiaodong Wu, Danny Z. ...