4131 search results - page 435 / 827 » Compactness in Topology and Computation |
184
click to vote
PVM
1997
Springer
15 years 11 months ago
1997
Springer
The traditional approach to the parallelization of linear algebra algorithms such as matrix multiplication and LU factorization calls for static allocation of matrix blocks to proc...
196
click to vote
ICCS
1994
Springer
15 years 11 months ago
1994
Springer
This paper gives a data structure (UDS) for supporting database retrieval, inference and machine learning that attempts to unify and extend previous work in relational databases, ...
158
click to vote
SIGGRAPH
1993
ACM
15 years 11 months ago
1993
ACM
A physically compact, low cost, high performance 3D graphics accelerator is presented. It supports shaded rendering of triangles and antialiased lines into a double-buffered 24-bi...
183
click to vote
TAGT
1994
Springer
15 years 11 months ago
1994
Springer
Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notat...
195
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
—In Dirichlet process (DP) mixture models, the number of components is implicitly determined by the sampling parameters of Dirichlet process. However, this kind of models usually...