Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Generalized Low-Computational Cost Laplacian Eigenmaps

    Dimensionality reduction (DR) is a methodology used in many fields linked to data processing, and may represent a preprocessing stage or be an essential element for the representation and classification of dat...

    J. A. Salazar-Castro, D. F. Peña, C. Basante in Intelligent Data Engineering and Automated… (2018)

  2. No Access

    Reference Work Entry In depth

    Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach

    Martin D. F. Wong, Honghua Hannah Yang in Encyclopedia of Algorithms (2016)

  3. No Access

    Reference Work Entry In depth

    Layout Decomposition for Multiple Patterning

    Haitong Tian, Martin D. F. Wong in Encyclopedia of Algorithms (2016)

  4. No Access

    Living Reference Work Entry In depth

    Layout Decomposition for Multiple Patterning

    Haitong Tian, Martin D. F. Wong in Encyclopedia of Algorithms

  5. No Access

    Living Reference Work Entry In depth

    Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach

    Martin D. F. Wong, Honghua Hannah Yang in Encyclopedia of Algorithms

  6. Chapter and Conference Paper

    Some Traditional Mathematical Knowledge Management

    What is mathematical knowledge and how can it be managed? There are not only differing views around on the management aspect but there is no real clarity or consensus on what mathematical knowledge is; indeed ...

    Patrick D. F. Ion in Intelligent Computer Mathematics (2009)

  7. No Access

    Reference Work Entry In depth

    Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach

    Honghua Hannah Yang, Martin D. F. Wong in Encyclopedia of Algorithms (2008)

  8. No Access

    Chapter

    Efficient Network Flow Based Min-Cut Balanced Partitioning

    We consider the problem of bipartitioning a circuit into two balanced components that minimizes the number of crossing nets. Previously, Kernighan and Lin type (K&L) heuristics, simulated annealing approach, a...

    Honghua Hannah Yang, D. F. Wong in The Best of ICCAD (2003)

  9. No Access

    Chapter

    Integrated Floorplanning and Interconnect Planning

    When VLSI technology enters the deep sub-micron era, communication between different components is significantly increased. Interconnect delay also becomes the dominant factor in total circuit delay. All these...

    Hung-Ming Chen, Martin D. F. Wong, Hai Zhou in Layout Optimization in VLSI Design (2001)

  10. No Access

    Chapter and Conference Paper

    Behavioural Analysis Methodology Oriented to Configuration of Parallel, Real-Time and Embedded Systems

    This paper describes a methodology suitable for behavioural analysis of parallel real-time and embedded systems. The main goal of the methodology is to achieve a proper configuration of the system in order to ...

    F. J. Suárez, D. F. García in Vector and Parallel Processing – VECPAR’98 (1999)

  11. No Access

    Chapter

    The Impact of New Architectures on the Ubiquitous Operational Amplifier

    The operational amplifier has steadily evolved since its inception almost fifty years ago. Sometimes though, radically new architectures appear to fill market requirements. Also, the availability of new I.C. p...

    D. F. Bowers in Analog Circuit Design (1993)

  12. No Access

    Article

    Probabilistic analysis of a grou** algorithm

    We study thegrou** by swap** problem, which occurs in memory compaction and in computing the exponential of a matrix. In this problem we are given a sequence ofn numbers drawn from {0,1, 2,...,m−1} with repet...

    D. F. Wong, Edward M. Reingold in Algorithmica (1991)

  13. No Access

    Article

    Floorplan design of VLSI circuits

    In this paper we present two algorithms for the floorplan design problem. The algorithms are quite similar in spirit. They both use Polish expressions to represent floorplans and employ the search method of si...

    D. F. Wong, C. L. Liu in Algorithmica (1989)

  14. No Access

    Article

    On the time required for reference count management in retention block-structured languages. Part 2

    In this paper, two implementations of generalized block-structured languages are presented and compared for time requirements. One implementation, the Lifetime Stack Model, implements the deletion strategy wit...

    D. M. Berry, L. M. Chirica, J. B. Johnston in International Journal of Computer & Inform… (1978)

  15. No Access

    Article

    Time required for reference count management in retention block-structured languages. Part 1

    In this paper, two implementations of generalized block-structured languages are presented and their time requirements compared. One implementation, the lifetime stack model (LSM), implements the deletion stra...

    D. M. Berry, L. M. Chirica, J. B. Johnston in International Journal of Computer & Inform… (1978)

  16. No Access

    Chapter and Conference Paper

    Verfahren zur Sicherung und Wiederherstellung von Datenbeständen

    Die zunehmende Komplexität und der enorme Umfang von Datenbeständen, wie sie bei modernen Datensystemen anfallen, werden zukünfig an die Integrität der Daten Anforderungen stellen, die heute noch weitgehend un...

    D. F. Jung in GI. Gesellschaft für Informatik e.V. 2. Jahrestagung (1973)