50 search results - page 10 / 10 » An Improved Approximation Factor For The Unit Disk Covering ... |
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
PODC
2009
ACM
14 years 6 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
SPAA
2003
ACM
13 years 11 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
DICTA
2007
13 years 7 months ago
2007
We present an efficient method for mutual information (MI) computation between images (2D or 3D) for NVIDIA’s ‘compute unified device architecture’ (CUDA) compatible devic...