5344 search results - page 24 / 1069 » Privacy-Preserving Set Operations |
JMLR
2011
14 years 6 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
131
click to vote
FROCOS
2009
Springer
15 years 6 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
112
click to vote
ECAI
2010
Springer
15 years 26 days ago
2010
Springer
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
SPAA
1998
ACM
15 years 4 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
CVPR
1996
IEEE
16 years 1 months ago
1996
IEEE
A fundamental problem in depth from defocus is the measurement of relative defocus between images. We propose a class of broadband operators that, when used together, provide inva...