172 search results - page 11 / 35 » Approximate low-rank factorization with structured factors |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
SIGCOMM
2006
ACM
14 years 2 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
AI
2011
Springer
13 years 3 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
JIIS
2002
13 years 8 months ago
2002
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...