-
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...
-
Reference Work Entry In depth
Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach
-
Reference Work Entry In depth
Layout Decomposition for Multiple Patterning
-
Living Reference Work Entry In depth
Layout Decomposition for Multiple Patterning
-
Living Reference Work Entry In depth
Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach
-
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 ...
-
Reference Work Entry In depth
Circuit Partitioning: A Network-Flow-Based Balanced Min-Cut Approach
-
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...
-
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...
-
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 ...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...