Sciweavers

3240 search results - page 25 / 648
» Pre-aggregation with probability distributions
Sort
View
PKDD
2007
Springer
91views Data Mining» more  PKDD 2007»
14 years 2 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
ICCV
2005
IEEE
14 years 1 months ago
Learning the Probability of Correspondences without Ground Truth
We present a quality assessment procedure for correspondence estimation based on geometric coherence rather than ground truth. The procedure can be used for performance evaluation...
Qingxiong Yang, R. Matt Steele, David Nisté...
JSAC
1998
126views more  JSAC 1998»
13 years 7 months ago
Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Frank R. Kschischang, Brendan J. Frey
3DPVT
2006
IEEE
139views Visualization» more  3DPVT 2006»
14 years 1 months ago
A Probabilistic Notion of Correspondence and the Epipolar Constraint
We present a probabilistic framework for correspondence and egomotion. First, we suggest computing probability distributions of correspondence. This has the advantage of being rob...
Justin Domke, Yiannis Aloimonos
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 2 months ago
Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
Han Cai, Do Young Eun