Sciweavers

18 search results - page 1 / 4
» On a sphere that passes through n lattice points
Sort
View
CCCG
2007
14 years 10 days ago
The Ordinary Line Problem Revisited
Let P be a set of n points in the plane. A connecting line of P is a line that passes through at least two of its points. A connecting line is called ordinary if it is incident on...
Asish Mukhopadhyay, Eugene Greene
FOCS
1998
IEEE
14 years 3 months ago
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
Daniele Micciancio
ENDM
2008
101views more  ENDM 2008»
13 years 11 months ago
A central approach to bound the number of crossings in a generalized configuration
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
Bernardo M. Ábrego, Silvia Fernández...
DCOSS
2006
Springer
14 years 2 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama