10608 search results - page 430 / 2122 » Complexity of O'Hara's Algorithm |
140
Voted
TCAD
2002
15 years 4 months ago
2002
In this paper, the authors propose an algorithm to find all the minimal signed digit (MSD) representations of a constant and present an algorithm to synthesize digital filters base...
134
click to vote
JDCTA
2010
14 years 11 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 ...
157
click to vote
JMLR
2010
14 years 11 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...
136
click to vote
JMMA
2010
14 years 11 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...
159
click to vote
TSP
2010
14 years 11 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...