Sciweavers

1059 search results - page 138 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
13 years 11 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
CVPR
2007
IEEE
14 years 11 months ago
What makes a good model of natural images?
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
Yair Weiss, William T. Freeman
IPMI
2007
Springer
14 years 9 months ago
Regional Appearance in Deformable Model Segmentation
Automated medical image segmentation is a challenging task that benefits from the use of effective image appearance models. In this paper, we compare appearance models at three reg...
Joshua Stough, Robert E. Broadhurst, Stephen M. Pi...
ISBI
2006
IEEE
14 years 9 months ago
A statistical appearance model based on intensity quantile histograms
We present a novel histogram method for statistically characterizing the appearance of deformable models. In deformable model segmentation, appearance models measure the likelihoo...
Robert E. Broadhurst, Joshua Stough, Stephen M. Pi...
ATAL
2007
Springer
14 years 28 days ago
On discovery and learning of models with predictive representations of state for agents with continuous actions and observations
Models of agent-environment interaction that use predictive state representations (PSRs) have mainly focused on the case of discrete observations and actions. The theory of discre...
David Wingate, Satinder P. Singh