791 search results - page 12 / 159 » Approximating the Maximum Sharing Problem |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
JMLR
2010
2010
Maximum Likelihood in Cost-Sensitive Learning: Model Specification, Approximations, and Upper Bounds
13 years 2 months ago
The presence of asymmetry in the misclassification costs or class prevalences is a common occurrence in the pattern classification domain. While much interest has been devoted to ...