13603 search results - page 259 / 2721 » On the Computational Complexity of Cut-Reduction |
241
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
187
click to vote
ICALP
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. The last decades have seen the emergence of the sea of objects paradigm for structuring complex distributed systems on workstations and local area networks. In this appro...
167
click to vote
FCCM
1998
IEEE
15 years 11 months ago
1998
IEEE
PAM-Blox are object-oriented circuit generators on top of the PCI Pamette design environment, PamDC. High- performance FPGA design for adaptive computing is simplified by using a ...
196
click to vote
FAW
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
180
click to vote
APWEB
2010
Springer
15 years 10 months ago
2010
Springer
The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains ...