4201 search results - page 358 / 841 » Interaction graphs: Additives |
180
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
171
click to vote
CVPR
2000
IEEE
15 years 11 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
188
click to vote
VLDB
1999
ACM
15 years 11 months ago
1999
ACM
Motivated to a large extent by the substantial and growing prominence of the World-Wide Web and the potential benefits that may be obtained by applying database concepts and tech...
186
click to vote
PPOPP
1997
ACM
15 years 11 months ago
1997
ACM
Array remappings are useful to many applications on distributed memory parallel machines. They are available in High Performance Fortran, a Fortran-based data-parallel language. T...
238
click to vote
ICPP
1996
IEEE
15 years 11 months ago
1996
IEEE
Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing s...