164 search results - page 7 / 33 » Maximally joining probabilistic data |
IDA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper we present a probabilistic algorithm which factorizes non-negative data. We employ entropic priors to additionally satisfy that user specified pairs of fac...
179
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
165
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
154
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We present a secure network service for sovereign information sharing whose only trusted component is an off-theshelf secure coprocessor. The participating data providers send enc...
88
Voted
PAMI
2011
14 years 4 months ago
2011
—This paper addresses the issue of matching rigid and articulated shapes through probabilistic point registration. The problem is recast into a missing data framework where unkno...