Sciweavers

149 search results - page 9 / 30
» What will they say
Sort
View
SEMWEB
2005
Springer
14 years 29 days ago
Representing Probabilistic Relations in RDF
Probabilistic inference will be of special importance when one needs to know how much we can say with what all we know given new observations. Bayesian Network is a graphical prob...
Yoshio Fukushige
FMCO
2005
Springer
153views Formal Methods» more  FMCO 2005»
14 years 1 months ago
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
PC
2007
147views Management» more  PC 2007»
13 years 7 months ago
Thread-safety in an MPI implementation: Requirements and analysis
The MPI-2 Standard has carefully specified the interaction between MPI and usercreated threads. The goal of this specification is to allow users to write multithreaded MPI progr...
William Gropp, Rajeev Thakur
CCCG
2007
13 years 9 months ago
On the Fewest Nets Problem for Convex Polyhedra
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
Val Pinciu
PKDD
2010
Springer
150views Data Mining» more  PKDD 2010»
13 years 5 months ago
Virus Propagation on Time-Varying Networks: Theory and Immunization Algorithms
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
B. Aditya Prakash, Hanghang Tong, Nicholas Valler,...