Sciweavers

329 search results - page 2 / 66
» New lower bounds for some spherical designs
Sort
View
ICASSP
2008
IEEE
14 years 2 days ago
Iterative extrapolation algorithm for data reconstruction over sphere
Given limited or incomplete measurement data on a sphere, a new iterative algorithm is proposed on how to extrapolate signal over the whole sphere. The algorithm is based on a pri...
Wen Zhang, Rodney A. Kennedy, Thushara D. Abhayapa...
JCT
2007
134views more  JCT 2007»
13 years 5 months ago
Improved Delsarte bounds for spherical codes in small dimensions
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on...
Florian Pfender
FOCS
2005
IEEE
13 years 11 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks
CP
2001
Springer
13 years 10 months ago
New Lower Bounds of Constraint Violations for Over-Constrained Problems
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
Jean-Charles Régin, Thierry Petit, Christia...
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 19 days ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy