16859 search results - page 3229 / 3372 » Generative software development |
130
click to vote
CCS
2008
ACM
15 years 3 months ago
2008
ACM
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
113
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
109
click to vote
CHI
2005
ACM
15 years 3 months ago
2005
ACM
HIPs, or Human Interactive Proofs, are challenges meant to be easily solved by humans, while remaining too hard to be economically solved by computers. HIPs are increasingly used ...
129
click to vote
CIKM
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
COLT
2008
Springer
15 years 3 months ago
2008
Springer
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...