Sciweavers

3220 search results - page 450 / 644
» Constrained Graph Processes
Sort
View
173
Voted
SG
2005
Springer
16 years 13 days ago
Automatic Cross-Sectioning Based on Topological Volume Skeletonization
: Cross-sectioning is a popular method for visualizing the complicated inner structures of three-dimensional volume datasets. However, the process is usually manual, meaning that a...
Yuki Mori, Shigeo Takahashi, Takeo Igarashi, Yurik...
165
Voted
PARELEC
2000
IEEE
15 years 11 months ago
Implementation of an Adaptive Reconfigurable Group Organized (ARGO) Parallel Architecture
The purpose of this paper is to demonstrate the implementation of an adaptable parallel architecture capable of system to task adaptation. The system implementation was based on X...
Lucas Szajek, Lev Kirischian
ICCAD
1992
IEEE
137views Hardware» more  ICCAD 1992»
15 years 11 months ago
Equivalent design representations and transformations for interactive scheduling
High-level synthesis (HLS) requires more designer interaction to better meet the needs of experienced designers. However, attempts to create a highly interactive synthesis process...
Roger P. Ang, Nikil D. Dutt
174
Voted
VLDB
1990
ACM
77views Database» more  VLDB 1990»
15 years 11 months ago
Efficient Main Memory Data Management Using the DBGraph Storage Model
Therequirementsfor amain memorydatastoragemodel are both compactnessand efficient processing for all database operations. The DBGraph storage model, proposed in this paper, achiev...
Philippe Pucheral, Jean-Marc Thévenin, Patr...
ICASSP
2009
IEEE
15 years 10 months ago
Principal component analysis in decomposable Gaussian graphical models
We consider principal component analysis (PCA) in decomposable Gaussian graphical models. We exploit the prior information in these models in order to distribute its computation. ...
Ami Wiesel, Alfred O. Hero III