Sciweavers

1830 search results - page 298 / 366
» Workshop on Graph Computation Models
Sort
View
SIBGRAPI
2006
IEEE
14 years 3 months ago
Duality between the Watershed by Image Foresting Transform and the Fuzzy Connectedness Segmentation Approaches
This paper makes a rereading of two successful image segmentation approaches, the fuzzy connectedness (FC) and the watershed (WS) approaches, by analyzing both by means of the Ima...
Romaric Audigier, Roberto de Alencar Lotufo
FCT
2005
Springer
14 years 2 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
POPL
1996
ACM
14 years 1 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
EGH
2004
Springer
14 years 20 days ago
Efficient partitioning of fragment shaders for multiple-output hardware
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
Tim Foley, Mike Houston, Pat Hanrahan
CVPR
2008
IEEE
13 years 9 months ago
Globally optimal surface segmentation using regional properties of segmented objects
Efficient segmentation of globally optimal surfaces in volumetric images is a central problem in many medical image analysis applications. Intra-class variance has been successful...
Xin Dou, Xiaodong Wu, Andreas Wahle, Milan Sonka