906 search results - page 115 / 182 » Map graphs |
144
click to vote
HIPEAC
2010
Springer
15 years 9 days ago
2010
Springer
Abstract. Stream programming is a promising way to expose concurrency to the compiler. A stream program is built from kernels that communicate only via point-to-point streams. The ...
139
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
139
Voted
PLDI
2012
ACM
13 years 4 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
134
click to vote
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
We consider the problem of reconstructing the shape of a surface with an arbitrary, spatially varying isotropic bidirectional reflectance distribution function (BRDF), and introdu...
136
Voted
JMLR
2010
15 years 22 days ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...