1066 search results - page 160 / 214 » Computing Private Set Operations with Linear Complexities |
SIGMOD
1997
ACM
15 years 1 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
112
click to vote
NSDI
2008
15 years 1 days ago
2008
Usenet is a popular distributed messaging and file sharing service: servers in Usenet flood articles over an overlay network to fully replicate articles across all servers. Howeve...
ICCAD
2005
IEEE
15 years 6 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
QEST
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract. We present a compositional theory of system verification, where specifications assign real-numbered costs to systems. These costs can express a wide variety of quantita...