Sciweavers

780 search results - page 16 / 156
» Cost-Sharing Approximations for h
Sort
View
ADCM
2008
187views more  ADCM 2008»
13 years 7 months ago
Approximation on the sphere using radial basis functions plus polynomials
In this paper we analyse a hybrid approximation of functions on the sphere S2 R3 by radial basis functions combined with polynomials, with the radial basis functions assumed to be...
Ian H. Sloan, Alvise Sommariva
DAC
2009
ACM
13 years 11 months ago
Fast vectorless power grid verification using an approximate inverse technique
Power grid verification in modern integrated circuits is an integral part of early system design where adjustments can be most easily incorporated. In this work, we describe an ea...
Nahi H. Abdul Ghani, Farid N. Najm
DAM
2006
191views more  DAM 2006»
13 years 7 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
ICC
2007
IEEE
14 years 1 months ago
Capacity Approximations for Multiuser MIMO-MRC with Antenna Correlation
— This paper investigates the capacity of multiuser MIMO-MRC systems in spatially correlated environments. We present new capacity approximations which are shown to be accurate. ...
Raymond H. Y. Louie, Matthew R. McKay, Iain B. Col...
ICALP
2005
Springer
14 years 25 days ago
Approximation Algorithms for Euclidean Group TSP
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H....