Sciweavers

3630 search results - page 122 / 726
» Fast Marching Methods
Sort
View
BILDMED
2004
125views Algorithms» more  BILDMED 2004»
15 years 4 months ago
Fast and Accurate Interactive Image Segmentation in the GEOMAP Framework
Although many interactive segmentation methods exists, none can be considered a silver bullet for all clinical tasks. Moreover, incompatible data representations prevent multiple a...
Hans Meine, Ullrich Köthe, H. Siegfried Stieh...
ESANN
2003
15 years 3 months ago
Fast approximation of the bootstrap for model selection
The bootstrap resampling method may be efficiently used to estimate the generalization error of a family of nonlinear regression models, as artificial neural networks. The main dif...
Geoffroy Simon, Amaury Lendasse, Vincent Wertz, Mi...
ANOR
2007
58views more  ANOR 2007»
15 years 2 months ago
A fast swap-based local search procedure for location problems
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
Mauricio G. C. Resende, Renato Fonseca F. Werneck
121
Voted
ICCV
2011
IEEE
14 years 2 months ago
Diffusion Runs Low on Persistence Fast
Interpreting an image as a function on a compact subset of the Euclidean plane, we get its scale-space by diffusion, spreading the image over the entire plane. This generates a 1-...
Chao Chen, Herbert Edelsbrunner
133
Voted
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
16 years 3 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...