919 search results - page 126 / 184 » Efficient computation of view subsets |
171
Voted
CLEANDB
2006
ACM
15 years 10 months ago
2006
ACM
We consider the Entity Resolution (ER) problem (also known as deduplication, or merge-purge), in which records determined to represent the same real-world entity are successively ...
166
click to vote
UAI
2008
15 years 8 months ago
2008
We introduce a new type of graphical model called a `cumulative distribution network' (CDN), which expresses a joint cumulative distribution as a product of local functions. ...
177
click to vote
WSCG
2001
15 years 8 months ago
2001
This paper presents a fast disparity analysis approach based on a hybrid block- and pixel-recursive matching scheme. The key idea is to choose efficiently a small number of candid...
240
click to vote
TSMC
2008
15 years 6 months ago
2008
This paper proposes a new perspective for solving systems of complex nonlinear equations by simply viewing them as a multiobjective optimization problem. Every equation in the syst...
182
click to vote
ICTAI
2009
IEEE
15 years 4 months ago
2009
IEEE
We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...