7773 search results - page 385 / 1555 » On generalized Frame-Stewart numbers |
183
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
187
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Collaborative recommender systems are highly vulnerable to attack. Attackers can use automated means to inject a large number of biased profiles into such a system, resulting in r...
160
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...
170
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
174
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...