Sciweavers

129 search results - page 6 / 26
» A Graph Reduction Method for 2D Snake Problems
Sort
View
CLEIEJ
2010
13 years 5 months ago
3D-Via Driven Partitioning for 3D VLSI Integrated Circuits
A 3D circuit is the stacking of regular 2D circuits. The advances on the fabrication and packaging technologies allowed interconnecting stacked 2D circuits by using 3D vias. Howeve...
Sandro Sawicki, Gustavo Wilke, Marcelo O. Johann, ...
CCGRID
2010
IEEE
13 years 8 months ago
High Performance Dimension Reduction and Visualization for Large High-Dimensional Data Analysis
Abstract--Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for understanding the results of data mining appro...
Jong Youl Choi, Seung-Hee Bae, Xiaohong Qiu, Geoff...
ENTCS
2008
102views more  ENTCS 2008»
13 years 7 months ago
Towards a Systematic Method for Proving Termination of Graph Transformation Systems
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
Harrie Jan Sander Bruggink
CVPR
2012
IEEE
11 years 10 months ago
Learning to segment dense cell nuclei with shape prior
We study the problem of segmenting multiple cell nuclei from GFP or Hoechst stained microscope images with a shape prior. This problem is encountered ubiquitously in cell biology ...
Xinghua Lou, Ullrich Köthe, Jochen Wittbrodt,...
ICML
2004
IEEE
14 years 8 months ago
Solving cluster ensemble problems by bipartite graph partitioning
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
Xiaoli Zhang Fern, Carla E. Brodley