876 search results - page 4 / 176 » Complexity in geometric SINR |
AAECC
2004
Springer
13 years 7 months ago
2004
Springer
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
TOH
2008
13 years 7 months ago
2008
Real-time evaluation of distributed contact forces between rigid or deformable 3D objects is a key ingredient of 6-DoF force-feedback rendering. Unfortunately, at very high tempora...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
CGI
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper, we present a versatile and robust model for geometrically complex deformable solids. Our approach can be applied to deformable tetrahedral meshes and to deformable ...