Cited By
View all- Johannes FPennino TYoffa E(1996)Partitioning of VLSI circuits and systemsProceedings of the 33rd annual Design Automation Conference10.1145/240518.240535(83-87)Online publication date: 1-Jun-1996
A robust min-cut improvement algorithm based on dynamic look-ahead weighting
Pages 21 - es
Abstract
No abstract available.
Index Terms
- A robust min-cut improvement algorithm based on dynamic look-ahead weighting
Recommendations
Robust local feature weighting hard c-means clustering algorithm
In view of local feature weighting hard c-means (LWHCM) clustering algorithm sensitive to noise, based on a non-Euclidean metric, a robust local feature weighting hard c-means (RLWHCM) clustering algorithm is presented. RLWHCM is a natural, effective ...
A look-ahead Levinson algorithm for general Toeplitz systems
The authors present an extension of Levinson's algorithm that is guaranteed to be weakly stable for a large class of general Toeplitz matrices, namely, those that do not have many consecutive ill-conditioned leading principal submatrices. The new ...
A new robust variable weighting coefficients diffusion LMS algorithm
We introduce a new robust algorithm that is insensitive to impulsive noise (IN) for distributed estimation problem over adaptive networks. Motivated by the fact that each node can access to multiple spatial data, we propose to discard IN-contaminated ...
Comments
Information & Contributors
Information
Published In
August 1995
Copyright © 1995 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- IFIP WG 10.2: IFIP WG 10.2
- IFIP WG 10.5: IFIP WG 10.5
- ISPJ: ISPJ
- IEICE: Inst of Electronics, Info & Communication Engineers
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE-CAS: Circuits & Systems
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 1995
Check for updates
Qualifiers
- Article
Conference
ASPDAC95
Sponsor:
- IFIP WG 10.2
- IFIP WG 10.5
- ISPJ
- IEICE
- SIGDA
- IEEE-CAS
ASPDAC95: Asia Pacific Design Automation Conference
August 29 - September 1, 1995
Makuhari, Massa, Chiba, Japan
Acceptance Rates
Overall Acceptance Rate 466 of 1,454 submissions, 32%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Jan 2025
Other Metrics
Citations
Cited By
View all- Johannes FPennino TYoffa E(1996)Partitioning of VLSI circuits and systemsProceedings of the 33rd annual Design Automation Conference10.1145/240518.240535(83-87)Online publication date: 1-Jun-1996