4403 search results - page 401 / 881 » Galois Theory of Algorithms |
172
Voted
COMPGEOM
2004
ACM
16 years 9 days ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
176
click to vote
COMPGEOM
2004
ACM
16 years 9 days ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
196
Voted
MM
2004
ACM
16 years 9 days ago
2004
ACM
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
208
Voted
MOBICOM
2004
ACM
16 years 8 days ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
188
click to vote
FOCS
2003
IEEE
16 years 4 days ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...