Sciweavers

1552 search results - page 252 / 311
» On the Complexity of Constant Propagation
Sort
View
MOC
1998
92views more  MOC 1998»
14 years 11 months ago
Perturbing polynomials with all their roots on the unit circle
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
Michael J. Mossinghoff, Christopher G. Pinner, Jef...
TELSYS
2002
73views more  TELSYS 2002»
14 years 11 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
TMI
2002
115views more  TMI 2002»
14 years 11 months ago
Discretization of the Radon transform and of its inverse by spline convolutions
Abstract--We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths and degrees . We apply our r...
Stefan Horbelt, Michael Liebling, Michael Unser
PUC
2008
174views more  PUC 2008»
14 years 11 months ago
A wireless sensor networks MAC protocol for real-time applications
Abstract Wireless sensor networks (WSN) are designed for data gathering and processing, with particular requirements: low hardware complexity, low energy consumption, special traff...
Esteban Egea-López, Javier Vales-Alonso, Al...
SPIRE
2010
Springer
14 years 10 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie