Sciweavers

2008 search results - page 360 / 402
» Computing with Equations
Sort
View
157
Voted
AAAI
2011
14 years 2 months ago
Mean Field Inference in Dependency Networks: An Empirical Study
Dependency networks are a compelling alternative to Bayesian networks for learning joint probability distributions from data and using them to compute probabilities. A dependency ...
Daniel Lowd, Arash Shamaei
IACR
2011
112views more  IACR 2011»
14 years 2 months ago
A Domain Transformation for Structure-Preserving Signatures on Group Elements
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...
Melissa Chase, Markulf Kohlweiss
ESOP
2012
Springer
13 years 10 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
TOG
2012
224views Communications» more  TOG 2012»
13 years 4 months ago
Lagrangian vortex sheets for animating fluids
Buoyant turbulent smoke plumes with a sharp smoke-air interface, such as volcanic plumes, are notoriously hard to simulate. The surface clearly shows small-scale turbulent structu...
Tobias Pfaff, Nils Thürey, Markus H. Gross
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 2 months ago
Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
Paul Christiano, Jonathan A. Kelner, Aleksander Ma...