Sciweavers

1830 search results - page 345 / 366
» Workshop on Graph Computation Models
Sort
View
AAAI
2011
14 years 6 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
ICPP
2006
IEEE
15 years 12 months ago
Data-Flow Analysis for MPI Programs
Message passing via MPI is widely used in singleprogram, multiple-data (SPMD) parallel programs. Existing data-flow frameworks do not model the semantics of message-passing SPMD ...
Michelle Mills Strout, Barbara Kreaseck, Paul D. H...
173
Voted
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
ACCV
2010
Springer
15 years 29 days ago
Social Interactive Human Video Synthesis
In this paper, we propose a computational model for social interaction between three people in a conversation, and demonstrate results using human video motion synthesis. We utilis...
Dumebi Okwechime, Eng-Jon Ong, Andrew Gilbert, Ric...
IPPS
1999
IEEE
15 years 10 months ago
Process Networks as a High-Level Notation for Metacomputing
Abstract. Our work involves the development of a prototype Geographical Information System GIS as an example of the use of process networks as a well-de ned high-level semantic mod...
Darren Webb, Andrew L. Wendelborn, Kevin Maciunas