Sciweavers

478 search results - page 1 / 96
» Improving probability bounds by optimization over subsets
Sort
View
DM
2006
70views more  DM 2006»
13 years 5 months ago
Improving probability bounds by optimization over subsets
The simple device of maximization over subsets of events can provide substantial improvement over the Dawson
Fred M. Hoppe
PKDD
2007
Springer
91views Data Mining» more  PKDD 2007»
13 years 11 months ago
Domain Adaptation of Conditional Probability Models Via Feature Subsetting
The goal in domain adaptation is to train a model using labeled data sampled from a domain different from the target domain on which the model will be deployed. We exploit unlabel...
Sandeepkumar Satpal, Sunita Sarawagi
MICCAI
2004
Springer
14 years 5 months ago
Segmentation of 3D Probability Density Fields by Surface Evolution: Application to Diffusion MRI
We propose an original approach for the segmentation of three-dimensional fields of probability density functions. This presents a wide range of applications in medical images proc...
Christophe Lenglet, Mikaël Rousson, Rachid De...
TIT
2008
90views more  TIT 2008»
13 years 4 months ago
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
Gil Wiechman, Igal Sason
AAAI
2010
13 years 6 months ago
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
Emma Rollon, Rina Dechter