We present node level primitives for parallel exact inference on an arbitrary Bayesian network. We explore the probability representation on each node of Bayesian networks and eac...
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
As many 3D on-line games appear, there is an increased need for simple and efficient techniques to create many new faces. This paper presents a new algorithm to composite 3D faces ...
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhat...
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...