Sciweavers

4679 search results - page 908 / 936
» Modeling When Connections Are the Problem
Sort
View
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
15 years 10 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
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...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
15 years 10 months ago
Effective multi-label active learning for text classification
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
Bishan Yang, Jian-Tao Sun, Tengjiao Wang, Zheng Ch...
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
15 years 10 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
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...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
15 years 10 months ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
15 years 10 months ago
Web site mining: a new way to spot competitors, customers and suppliers in the world wide web
When automatically extracting information from the world wide web, most established methods focus on spotting single HTMLdocuments. However, the problem of spotting complete web s...
Martin Ester, Hans-Peter Kriegel, Matthias Schuber...