Sciweavers

5210 search results - page 242 / 1042
» Exact geometric computation
Sort
View
ICALP
1992
Springer
15 years 10 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
158
Voted
CCCG
1996
15 years 8 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 6 months ago
Geometry and the complexity of matrix multiplication
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
J. M. Landsberg
TCS
2008
15 years 6 months ago
The moving curve ideal and the Rees algebra
These are notes for a lecture given at Ohio University on June 3, 2006. An important topic in commutative algebra is the Rees algebra of an ideal in a commutative ring. The Rees al...
David A. Cox
MOC
2000
68views more  MOC 2000»
15 years 6 months ago
Numerical approximations of one-dimensional linear conservation equations with discontinuous coefficients
Conservative linear equations arise in many areas of application, including continuum mechanics or high-frequency geometrical optics approximations. This kind of equation admits mo...
Laurent Gosse, François James