Sciweavers

531 search results - page 58 / 107
» A Better Algorithm for Random k-SAT
Sort
View
JMLR
2012
11 years 10 months ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
ICML
2006
IEEE
14 years 8 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
DISCO
1993
114views Hardware» more  DISCO 1993»
14 years 14 hour ago
Gauss: A Parameterized Domain of Computation System with Support for Signature Functions
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
Michael B. Monagan
UAI
2003
13 years 9 months ago
On Local Optima in Learning Bayesian Networks
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
Jens D. Nielsen, Tomás Kocka, José M...
TKDE
2012
199views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang