Sciweavers

422 search results - page 29 / 85
» Generalizations of small profinite structures
Sort
View
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
14 years 5 months ago
Deletion Without Rebalancing in Balanced Binary Trees
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
Siddhartha Sen, Robert E. Tarjan
ICCD
1996
IEEE
108views Hardware» more  ICCD 1996»
14 years 18 days ago
Module Generators for a Regular Analog Layout
In general, automatic layout composition techniques based on pre-designed devices facilitate the production of small IC numbers by prefabricating their basic structures. They also...
J. Kampe, C. Wisser, G. Scarbata
ISSAC
2009
Springer
184views Mathematics» more  ISSAC 2009»
14 years 3 months ago
An iterative method for calculating approximate GCD of univariate polynomials
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
Akira Terui
PODC
2005
ACM
14 years 2 months ago
Distance estimation and object location via rings of neighbors
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
Aleksandrs Slivkins
DAC
2010
ACM
14 years 10 days ago
Representative path selection for post-silicon timing prediction under variability
The identification of speedpaths is required for post-silicon (PS) timing validation, and it is currently becoming timeconsuming due to manufacturing variations. In this paper we...
Lin Xie, Azadeh Davoodi