1066 search results - page 174 / 214 » Computing Private Set Operations with Linear Complexities |
102
click to vote
ICFEM
1997
Springer
15 years 1 months ago
1997
Springer
A real-time computer system is a system that must perform its functions within specified time bounds. These systems are generally characterized by complex interactions with the en...
85
Voted
AAAI
2006
14 years 11 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
141
click to vote
PAMI
2010
14 years 8 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
85
Voted
SIGGRAPH
2000
ACM
15 years 2 months ago
2000
ACM
Visualization of very complex scenes can be significantly accelerated using occlusion culling. In this paper we present a visibility preprocessing method which efficiently compu...
EUROPAR
2009
Springer
15 years 2 months ago
2009
Springer
Multicore architectures featuring specialized accelerators are getting an increasing amount of attention, and this success will probably influence the design of future High Perfor...