Sciweavers

1395 search results - page 241 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
ALGOSENSORS
2009
Springer
14 years 3 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
INFOCOM
2007
IEEE
14 years 2 months ago
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...
STACS
1999
Springer
14 years 23 days ago
Costs of General Purpose Learning
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
John Case, Keh-Jiann Chen, Sanjay Jain
COCO
2010
Springer
135views Algorithms» more  COCO 2010»
14 years 13 days ago
Lower Bounds for Testing Function Isomorphism
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
Eric Blais, Ryan O'Donnell
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 8 months ago
Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...