Sciweavers

2629 search results - page 125 / 526
» complex 2009
Sort
View
126
Voted
JMLR
2011
125views more  JMLR 2011»
14 years 7 months ago
Approximate Marginals in Latent Gaussian Models
We consider the problem of improving the Gaussian approximate posterior marginals computed by expectation propagation and the Laplace method in latent Gaussian models and propose ...
Botond Cseke, Tom Heskes
202
Voted
POPL
2009
ACM
16 years 1 months ago
Unifying type checking and property checking for low-level code
We present a unified approach to type checking and property checking for low-level code. Type checking for low-level code is challenging because type safety often depends on compl...
Jeremy Condit, Brian Hackett, Shuvendu K. Lahiri, ...
DIS
2009
Springer
15 years 4 months ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
103
Voted
ALGOSENSORS
2009
Springer
15 years 7 months ago
Link Reversal: How to Play Better to Work Less
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
Bernadette Charron-Bost, Jennifer L. Welch, Josef ...
113
Voted
CANS
2009
Springer
164views Cryptology» more  CANS 2009»
15 years 7 months ago
Extensions of the Cube Attack Based on Low Degree Annihilators
At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an ini...
Aileen Zhang, Chu-Wee Lim, Khoongming Khoo, Lei We...