Sciweavers

97 search results - page 18 / 20
» A probabilistic language based on sampling functions
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 5 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
83
Voted
ATAL
2010
Springer
14 years 10 months ago
History-dependent graphical multiagent models
A dynamic model of a multiagent system defines a probability distribution over possible system behaviors over time. Alternative representations for such models present tradeoffs i...
Quang Duong, Michael P. Wellman, Satinder P. Singh...
112
Voted
IROS
2008
IEEE
238views Robotics» more  IROS 2008»
15 years 4 months ago
Shape-guided superpixel grouping for trail detection and tracking
Abstract— We describe a framework for detecting and tracking continuous ”trails” in images and image sequences for autonomous robot navigation. Continuous trails are extended...
Christopher Rasmussen, Donald Scott
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
BMCBI
2005
114views more  BMCBI 2005»
14 years 9 months ago
Extension of Lander-Waterman theory for sequencing filtered DNA libraries
Background: The degree to which conventional DNA sequencing techniques will be successful for highly repetitive genomes is unclear. Investigators are therefore considering various...
Michael C. Wendl, W. Bradley Barbazuk