Sciweavers

2354 search results - page 299 / 471
» Randomness, Stochasticity and Approximations
Sort
View
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 9 months ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
DC
2011
14 years 6 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
CVPR
2005
IEEE
16 years 8 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
CVPR
2007
IEEE
16 years 8 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
DCC
2004
IEEE
16 years 5 months ago
On the Entropy of a Hidden Markov Process
We study the entropy rate of a hidden Markov process (HMP) defined by observing the output of a binary symmetric channel whose input is a first-order binary Markov process. Despit...
Philippe Jacquet, Gadiel Seroussi, Wojciech Szpank...