Sciweavers

1257 search results - page 226 / 252
» A generalization of Euler's constant
Sort
View
COMPGEOM
2010
ACM
14 years 21 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
COMPGEOM
2010
ACM
14 years 21 days ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
14 years 20 days ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
SIGMETRICS
2010
ACM
208views Hardware» more  SIGMETRICS 2010»
14 years 13 days ago
Dynamics in congestion games
Game theoretic modeling and equilibrium analysis of congestion games have provided insights in the performance of Internet congestion control, road transportation networks, etc. D...
Devavrat Shah, Jinwoo Shin
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
14 years 13 days ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh