Sciweavers

16159 search results - page 2633 / 3232
» Parallel computing with CUDA
Sort
View
DGCI
2008
Springer
15 years 8 months ago
On Watershed Cuts and Thinnings
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
JSC
2010
96views more  JSC 2010»
15 years 5 months ago
On a generalization of Stickelberger's Theorem
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
Peter Scheiblechner
MICCAI
2010
Springer
15 years 5 months ago
Fast Ultrasound Image Simulation Using the Westervelt Equation
Abstract. The simulation of ultrasound wave propagation is of high interest in fields as ultrasound system development and therapeutic ultrasound. From a computational point of vi...
Athanasios Karamalis, Wolfgang Wein, Nassir Navab
CCR
2010
132views more  CCR 2010»
15 years 4 months ago
Scafida: a scale-free network inspired data center architecture
Data centers have a crucial role in current Internet architecture supporting content-centric networking. State-of-theart data centers have different architectures like fat-tree [1...
László Gyarmati, Tuan Anh Trinh
DAM
2010
105views more  DAM 2010»
15 years 4 months ago
An iterative approach to graph irregularity strength
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
Michael Ferrara, Ronald J. Gould, Michal Karonski,...
« Prev « First page 2633 / 3232 Last » Next »