15485 search results - page 627 / 3097 » Computing Optimal Subsets |
198
click to vote
FOCS
2009
IEEE
16 years 2 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
193
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
200
click to vote
PPOPP
2006
ACM
16 years 1 months ago
2006
ACM
In prior work, we have proposed techniques to extend the ease of shared-memory parallel programming to distributed-memory platforms by automatic translation of OpenMP programs to ...
183
click to vote
SC
2003
ACM
16 years 14 days ago
2003
ACM
This paper presents a case study of the 10-Gigabit Ethernet (10GbE) adapter from Intel R . Specifically, with appropriate optimizations to the configurations of the 10GbE adapte...
214
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...