Sciweavers

522 search results - page 35 / 105
» The 3-Steiner Root Problem
Sort
View
ADCM
2010
92views more  ADCM 2010»
13 years 8 months ago
Construction of infinite unimodular sequences with zero autocorrelation
Unimodular waveforms x are constructed on the integers with the property that the autocorrelation of x is one at the origin and zero elsewhere. There are three different constructi...
John J. Benedetto, Somantika Datta
IPL
2002
90views more  IPL 2002»
13 years 8 months ago
On the approximability of two tree drawing conventions
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
Paolo Penna

Publication
101views
12 years 2 months ago
On the degree and half-degree principle for symmetric polynomials
In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte (2003) [15]. It says that a symmetric real polynomial F of degree d in n variabl...
Cordian Riener
ICCD
1995
IEEE
100views Hardware» more  ICCD 1995»
14 years 6 days ago
Transformation of min-max optimization to least-square estimation and application to interconnect design optimization
This paper describes a novel approach to nd a tighter bound of the transformation of the Min-Max problems into the one of Least-Square Estimation. It is well known that the above ...
Jimmy Shinn-Hwa Wang, Wayne Wei-Ming Dai
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 10 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen