C. Alpert and S. Yao. Spectral partitioning: The more eigenvectors, the better. In Proc. ACM/IEEE Design Automation Conference, 1995. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
A Unifying Theorem for Spectral Embedding and Clustering - Brand, Huang (2003) (6 citations) (Correct)
On Spectral Methods and the Structuring of Home Videos - Odobez, Gatica-Perez.. (2002) (Correct)
On Spectral Clustering: Analysis and an algorithm - Ng, Jordan, Weiss (2001) (68 citations) (Correct)
On Spectral Clustering: Analysis and an algorithm - Ng, Jordan, Weiss (2001) (68 citations) (Correct)
Optimal Model-Based Decomposition of Powertrain System Design - Michelena, Papalambros (1995) (4 citations) (Correct)
Partitioning Sparse Rectangular Matrices for Parallel Processing - Kolda (1998) (4 citations) (Correct)
PROP: A Recursive Paradigm for Area-Efficient and Performance .. - Kuznar, Brglez (1995) (6 citations) (Correct)
Merl -- A Mitsubishi Electric Research Laboratory - Http Www Merl (2002) (Correct)
An Architecture for Mining Massive Web Logs with.. - Benczur, Csalogany.. (2003) (Correct)
Merl -- A Mitsubishi Electric Research Laboratory - Http Www Merl (2002) (Correct)
[190] H. Yang and D. F. Wong. Efficient network flow based.. - Proc Ieee (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC