Sciweavers

919 search results - page 126 / 184
» Efficient computation of view subsets
Sort
View
CLEANDB
2006
ACM
112views Database» more  CLEANDB 2006»
14 years 1 months ago
Generic Entity Resolution with Data Confidences
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 ...
David Menestrina, Omar Benjelloun, Hector Garcia-M...
UAI
2008
13 years 11 months ago
Cumulative distribution networks and the derivative-sum-product algorithm
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. ...
Jim C. Huang, Brendan J. Frey
WSCG
2001
91views more  WSCG 2001»
13 years 11 months ago
Fast Hybrid Block- and Pixel- Recursive Disparity Analysis for Real-Time Applications in Immersive Tele-Conference Scenarios
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...
Peter Kauff, Nicole Brandenburg, Michael Karl, Oli...
TSMC
2008
147views more  TSMC 2008»
13 years 9 months ago
A New Approach for Solving Nonlinear Equations Systems
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...
Crina Grosan, Ajith Abraham
ICTAI
2009
IEEE
13 years 7 months ago
Merging Qualitative Constraint Networks in a Piecewise Fashion
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...
Jean-François Condotta, Souhila Kaci, Pierr...