10988 search results - page 516 / 2198 » Algorithmic Folding Complexity |
190
click to vote
JDCTA
2010
15 years 1 months ago
2010
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
218
click to vote
JMLR
2010
15 years 1 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
177
click to vote
JMMA
2010
15 years 1 months ago
2010
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
209
click to vote
TSP
2010
15 years 1 months ago
2010
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
224
click to vote
COMGEO
2012
ACM
14 years 2 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...