Sciweavers

1672 search results - page 95 / 335
» Tightness problems in the plane
Sort
View
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 10 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
SIAMIS
2010
171views more  SIAMIS 2010»
15 years 13 days ago
Global Optimization for One-Dimensional Structure and Motion Problems
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
Olof Enqvist, Fredrik Kahl, Carl Olsson, Kalle &Ar...
ALGOSENSORS
2009
Springer
16 years 9 days 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
2005
IEEE
15 years 11 months ago
Packetostatics: deployment of massively dense sensor networks as an electrostatics problem
— We investigate the spatial distribution of wireless nodes that can transport a given volume of traffic in a sensor network, while requiring the minimum number of wireless node...
Stavros Toumpis, Leandros Tassiulas
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 3 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac