Sciweavers

4451 search results - page 689 / 891
» On Random Ordering Constraints
Sort
View
ICVGIP
2008
15 years 8 months ago
How Much Zoom is the Right Zoom from the Perspective of Super-Resolution?
Constructing a high-resolution (HR) image from lowresolution (LR) image(s) has been a very active research topic recently with focus shifting from multi-frames to learning based s...
Himanshu Arora, Anoop M. Namboodiri
SDM
2008
SIAM
122views Data Mining» more  SDM 2008»
15 years 8 months ago
Type-Independent Correction of Sample Selection Bias via Structural Discovery and Re-balancing
Sample selection bias is a common problem in many real world applications, where training data are obtained under realistic constraints that make them follow a different distribut...
Jiangtao Ren, Xiaoxiao Shi, Wei Fan, Philip S. Yu
UAI
1997
15 years 7 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
AAAI
1996
15 years 7 months ago
Lazy Arc Consistency
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
Thomas Schiex, Jean-Charles Régin, Christin...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 7 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe