197 search results - page 13 / 40 » Improved Approximation Algorithms for Bipartite Correlation ... |
IS
2007
13 years 7 months ago
2007
Emerging applications introduce the requirement for novel association-rule mining algorithms that will be scalable not only with respect to the number of records (number of rows) ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—This paper explores the behavior similarity of Internet end hosts in the same network prefixes. We use bipartite graphs to model network traffic, and then construct on...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
In many applications, the expert interpretation of coclustering is easier than for mono-dimensional clustering. Co-clustering aims at computing a bi-partition that is a collection...