449 search results - page 60 / 90 » Degenerate crossing numbers |
JSC
2010
14 years 4 months ago
2010
A Chebyshev knot C(a, b, c, ) is a knot which has a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + ), where a, b, c are integers, Tn(t) is the Chebyshev pol...
DCG
2006
14 years 9 months ago
2006
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
104
click to vote
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
The wide availability of GPS sensors is changing the landscape in the applications of structure from motion techniques for localization. In this paper, we study the problem of est...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...