1819 search results - page 137 / 364 » Computability and Representations of the Zero Set |
SC
1995
ACM
15 years 1 months ago
1995
ACM
The goal of this work is to explore architectural mechanisms for supporting explicit communication in cachecoherent shared memory multiprocessors. The motivation stems from the ob...
CVPR
2011
IEEE
14 years 1 months ago
2011
IEEE
Dictionary learning is a challenging theme in computer vision. The basic goal is to learn a sparse representation from an overcomplete basis set. Most existing approaches employ a...
109
click to vote
EOR
2011
14 years 5 months ago
2011
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
UAI
2004
14 years 11 months ago
2004
One of the major problems in modeling natural signals is that signals with very similar structure may locally have completely different measurements, e.g., images taken under diff...