5005 search results - page 132 / 1001 » The Design and Analysis of Parallel Algorithms |
102
Voted
KBSE
2006
IEEE
15 years 6 months ago
2006
IEEE
Traditional design representations are inadequate for generalized reasoning about modularity in design and its technical and economic implications. We have developed an architectu...
121
Voted
TVCG
2012
13 years 3 months ago
2012
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
92
Voted
KBSE
2008
IEEE
15 years 7 months ago
2008
IEEE
The Design Exploration (DE) approach allows a large number of probable end users to communicate with software developers by creating mockups of user interfaces and augmenting the ...
109
Voted
ESANN
2008
15 years 2 months ago
2008
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
131
Voted
IPCO
1998
15 years 2 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...