Sciweavers

1414 search results - page 189 / 283
» Randomness and Universal Machines
Sort
View
220
Voted
DC
2011
14 years 3 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
149
Voted
CVPR
2009
IEEE
16 years 10 months ago
Learning Optimized MAP Estimates in Continuously-Valued MRF Models
We present a new approach for the discriminative training of continuous-valued Markov Random Field (MRF) model parameters. In our approach we train the MRF model by optimizing t...
Kegan G. G. Samuel, Marshall F. Tappen
CVPR
2005
IEEE
16 years 5 months ago
Fields of Experts: A Framework for Learning Image Priors
We develop a framework for learning generic, expressive image priors that capture the statistics of natural scenes and can be used for a variety of machine vision tasks. The appro...
Stefan Roth, Michael J. Black
134
Voted
ICIP
2008
IEEE
16 years 5 months ago
Implicit spatial inference with sparse local features
This paper introduces a novel way to leverage the implicit geometry of sparse local features (e.g. SIFT operator) for the purposes of object detection and segmentation. A two-clas...
Deirdre O'Regan, Anil C. Kokaram
135
Voted
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 3 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...