20441 search results - page 354 / 4089 » Locally Computable Structures |
168
click to vote
HPCN
1997
Springer
15 years 9 months ago
1997
Springer
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
229
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
221
Voted
PPOPP
2010
ACM
16 years 2 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
147
click to vote
ICIP
2001
IEEE
16 years 6 months ago
2001
IEEE
An area based counterpart of the binary structural opening spectra is developed. It is shown that these area opening and closing spectra can be computed using an adaptation of Tar...
142
click to vote
ACL
2007
15 years 6 months ago
2007
This paper describes a new method for computing lexical chains. These are sequences of semantically related words that reflect a text’s cohesive structure. In contrast to previo...