4539 search results - page 144 / 908 » Approaches to Compute Workflow Complexity |
VIS
2006
IEEE
15 years 11 months ago
2006
IEEE
Current practice in particle visualization renders particle position data directly onto the screen as points or glyphs. Using a camera placed at a fixed position, particle motions...
123
click to vote
CORR
2012
Springer
13 years 5 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...
ICALP
1999
Springer
15 years 2 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...
CP
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
ALMOB
2006
14 years 10 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...