831 search results - page 41 / 167 » Finding Minimum Data Requirements Using Pseudo-independence |
OSDI
1996
ACM
13 years 11 months ago
1996
ACM
We present the design and evaluation of an on-thefly data-race-detection technique that handles applications written for the lazy release consistent (LRC) shared memory model. We ...
ICML
2004
IEEE
14 years 11 months ago
2004
IEEE
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
ICDE
2005
IEEE
14 years 11 months ago
2005
IEEE
Most data integration applications require a matching between the schemas of the respective data sets. We show how the existence of duplicates within these data sets can be exploi...
IJCM
2002
13 years 10 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
CVPR
1996
IEEE
15 years 3 days ago
1996
IEEE
Despite many successful applications of robust statistics, they have yet to be completely adapted to many computer vision problems. Range reconstruction, particularly in unstructu...