172 search results - page 18 / 35 » Approximate low-rank factorization with structured factors |
TAMC
2010
Springer
13 years 7 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
IJCV
2007
13 years 8 months ago
2007
The paper first traces the image-based modeling back to feature tracking and factorization that have been developed in the group led by Kanade since the eighties. Both feature tra...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that t...