Sciweavers

725 search results - page 26 / 145
» Bounding Degrees on RPL
Sort
View
APAL
2010
125views more  APAL 2010»
14 years 9 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
14 years 9 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist
CCCG
2010
14 years 11 months ago
Triangulations with many points of even degree
Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangul...
Jorge Urrutia, Canek Peláez, Adriana Ram&ia...
GLOBECOM
2009
IEEE
15 years 4 months ago
Analysis of Degrees of Freedom of Interfering MISO Broadcast Channels
— In this paper, we provide a lower and upper bound for the number of degrees of freedom (DOF) of B multipleinput single-output (MISO) broadcast channels (BC) where each base sta...
Seokhwan Park, Inkyu Lee
80
Voted
IPPS
2005
IEEE
15 years 3 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou