Sciweavers

933 search results - page 107 / 187
» Monotone Complexity of a Pair
Sort
View
ASPDAC
2009
ACM
144views Hardware» more  ASPDAC 2009»
14 years 1 months ago
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
Nikolaos D. Liveris, Hai Zhou, Prithviraj Banerjee
INFOCOM
2000
IEEE
14 years 1 months ago
Scalable, Low-Overhead Network Delay Estimation
Estimating the network delays between each pair of nodes in a multicast session is the key parameter in reliable multicast; it is used, among other things, in suppressing the impl...
Volkan Ozdemir, S. Muthukrishnan, Injong Rhee
ADBIS
1998
Springer
100views Database» more  ADBIS 1998»
14 years 1 months ago
Multiple Range Query Optimization in Spatial Databases
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Apostolos Papadopoulos, Yannis Manolopoulos
AGP
1997
IEEE
14 years 1 months ago
Sharing Revisited
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes setsharing. In thi...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
DAC
1989
ACM
14 years 13 days ago
An Efficient Finite Element Method for Submicron IC Capacitance Extraction
We present an accurate and efficient method for extraction of parasitic capacitances in submicron integrated circuits. The method uses a 3-D finite element model in which the cond...
N. P. van der Meijs, Arjan J. van Genderen