Sciweavers

329 search results - page 3 / 66
» New lower bounds for some spherical designs
Sort
View
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
14 years 1 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
JGAA
1998
116views more  JGAA 1998»
13 years 7 months ago
New Lower Bounds For Orthogonal Drawings
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
Therese C. Biedl
DCG
1999
58views more  DCG 1999»
13 years 7 months ago
Nonexistence of Certain Spherical Designs of Odd Strengths and Cardinalities
A spherical -design on Sn-1 is a finite set such that, for all polynomials f of degree at most , the average of f over the set is equal to the average of f over the sphere Sn-1 . ...
Peter Boyvalenkov, Danyo Danev, Svetla Nikova
MP
2006
137views more  MP 2006»
13 years 7 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher
ACISP
1997
Springer
13 years 11 months ago
New Lower Bounds on Nonlinearity and a Class of Highly Nonlinear Functions
Abstract. Highly nonlinear Boolean functions occupy an important position in the design of secure block as well as stream ciphers. This paper proves two new lower bounds on the non...
Xian-Mo Zhang, Yuliang Zheng