Sciweavers

34 search results - page 2 / 7
» Parallel Computation of 2D Morse-Smale Complexes
Sort
View
JSC
2010
96views more  JSC 2010»
13 years 3 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
DATE
2008
IEEE
133views Hardware» more  DATE 2008»
13 years 11 months ago
Memory Organization with Multi-Pattern Parallel Accesses
We propose an interleaved memory organization supporting multi-pattern parallel accesses in twodimensional (2D) addressing space. Our proposal targets computing systems with high ...
Arseni Vitkovski, Georgi Kuzmanov, Georgi Gaydadji...
ICCAD
1996
IEEE
164views Hardware» more  ICCAD 1996»
13 years 9 months ago
A novel dimension reduction technique for the capacitance extraction of 3D VLSI interconnects
In this paper, we present a new capacitance extraction method named Dimension Reduction Technique (DRT) for 3D VLSI interconnects. The DRT converts a complex 3D problem into a ser...
Wei Hong II, Weikai Sun, Zhenhai Zhu, Hao Ji, Ben ...
DAGSTUHL
2007
13 years 6 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis
HPCN
1998
Springer
13 years 9 months ago
A Barotropic Global Ocean Model and its Parallel Implementation on Unstructured Grids
Unstructured grids can represent the complex geometry of the ocean basin with high delity. The lack of development tools supporting irregular grid problems discourages the use of ...
Hakan Öksüzoglu, A. G. M. van Hees