Sciweavers

194 search results - page 18 / 39
» Randomness for Free
Sort
View
UAI
2003
13 years 9 months ago
Approximate Inference and Constrained Optimization
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
Tom Heskes, Kees Albers, Bert Kappen
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Randomized Algorithms for Motif Detection
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
Lusheng Wang, Liang Dong, Hui Fan
IJNSEC
2010
128views more  IJNSEC 2010»
13 years 3 months ago
New Efficient Searchable Encryption Schemes from Bilinear Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu
ICDAR
2005
IEEE
14 years 2 months ago
A Model for Detecting and Merging Vertically Spanned Table Cells in Plain Text Documents
A spanned cell in a table is a single, complete unit that physically occupies multiple columns and/or multiple rows. Spanned cells are common in tables, and they are a significan...
Vanessa Long, Robert Dale, Steve Cassidy
UAI
2004
13 years 9 months ago
Case-Factor Diagrams for Structured Probabilistic Modeling
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
David A. McAllester, Michael Collins, Fernando Per...