We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
A probabilistic model for software development projects is constructed. The model can be applied to compute an estimate for the development time of a project. The chances of succee...
Since the 1960's many authors accepted the triple constraints (time, cost, specification) as a standard measure of success and this still appears to be extremely important in...
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
We present a generative model for performing sparse probabilistic projections, which includes sparse principal component analysis and sparse canonical correlation analysis as spec...