Sciweavers

1672 search results - page 140 / 335
» Tightness problems in the plane
Sort
View
MOBIHOC
2007
ACM
15 years 10 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
DCOSS
2009
Springer
15 years 5 months ago
Cheap or Flexible Sensor Coverage
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
SIAMAM
2008
80views more  SIAMAM 2008»
14 years 11 months ago
The Factorization Method for Electrical Impedance Tomography in the Half-Space
We consider the inverse problem of electrical impedance tomography in a conducting half space, given electrostatic measurements on its boundary, i.e., a hyperplane. We first provid...
Martin Hanke, Birgit Schappel
FOCS
2005
IEEE
15 years 4 months ago
The Complexity of Online Memory Checking
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
Moni Naor, Guy N. Rothblum
CORR
2007
Springer
115views Education» more  CORR 2007»
14 years 11 months ago
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
Neri Merhav