19866 search results - page 116 / 3974 » Computing all factorizations in *** |
171
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
The Web abounds with dyadic data that keeps increasing by every single second. Previous work has repeatedly shown the usefulness of extracting the interaction structure inside dya...
140
click to vote
CGF
2008
15 years 6 months ago
2008
Interactive rendering with dynamic natural lighting and changing view is a long-standing goal in computer graphics. Recently, precomputation-based methods for all-frequency religh...
178
click to vote
SIAMSC
2010
15 years 1 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
180
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
158
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...