Sciweavers

1132 search results - page 25 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
APPROX
2006
Springer
106views Algorithms» more  APPROX 2006»
13 years 11 months ago
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
Hubert T.-H. Chan, Donglin Xia, Goran Konjevod, An...
TON
2010
118views more  TON 2010»
13 years 2 months ago
Capacity Scaling of Wireless Networks With Inhomogeneous Node Density: Lower Bounds
Abstract-- We consider static ad hoc wireless networks comprising significant inhomogeneities in the node spatial distribution over the area, and analyze the scaling laws of their ...
Giusi Alfano, Michele Garetto, Emilio Leonardi, Va...
IPL
2007
111views more  IPL 2007»
13 years 7 months ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov
MSS
2010
IEEE
127views Hardware» more  MSS 2010»
13 years 5 months ago
Fair intergenerational sharing of a natural resource
Overlapping generations are extracting a natural resource over an infinite future. We examine fair allocation of resource and compensations among generations. Fairness is define...
Hippolyte d'Albis, Stefan Ambec
DISOPT
2007
114views more  DISOPT 2007»
13 years 7 months ago
Bounds for online bounded space hypercube packing
In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed withi...
Leah Epstein, Rob van Stee