19130 search results - page 3674 / 3826 » Modelling multi-path problems |
123
click to vote
TCC
2009
Springer
16 years 3 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
126
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
127
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
153
Voted
KDD
2009
ACM
16 years 3 months ago
2009
ACM
The explosion of user-generated content on the Web has led to new opportunities and significant challenges for companies, that are increasingly concerned about monitoring the disc...
125
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...