172 search results - page 9 / 35 » Approximate low-rank factorization with structured factors |
122
click to vote
IPL
2008
14 years 11 months ago
2008
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k. Key words: approximation algorithm,...
111
click to vote
COMPGEOM
1997
ACM
15 years 4 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
128
click to vote
ESA
2011
Springer
13 years 11 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
STOC
2003
ACM
16 years 1 days ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...