2343 search results - page 342 / 469 » Structure and Interpretation of Computer Programs |
138
Voted
ISHPC
1997
Springer
15 years 9 months ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...
139
click to vote
CGA
1998
15 years 4 months ago
1998
ns, with large, abstract, multidimensional data sets that are visually represented in multiple ways. We illustrate how spreadsheet techniques provide a structured, intuitive, and p...
150
Voted
WOTUG
2008
15 years 6 months ago
2008
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...
160
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...
124
click to vote
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We consider the problem of classification when multiple observations of a pattern are available, possibly under different transformations. We view this problem as a special case o...