3946 search results - page 435 / 790 » The computational complexity of choice sets |
169
click to vote
ISSAC
2004
Springer
16 years 7 days ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
172
click to vote
RT
2004
Springer
16 years 7 days ago
2004
Springer
We present a novel aggressive visibility preprocessing technique for general 3D scenes. Our technique exploits commodity graphics hardware and is faster than most conservative sol...
173
click to vote
GD
2003
Springer
16 years 3 days ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
187
click to vote
IMR
2003
Springer
16 years 2 days ago
2003
Springer
Topology modification of hexahedral meshes has been considered difficult due to the propagation of topological modifications non-locally. We address this problem by working in the...
217
click to vote
DSN
2000
IEEE
15 years 11 months ago
2000
IEEE
Multiple-Phased Systems, whose operational life can be partitioned in a set of disjoint periods, called “phases”, include several classes of systems such as Phased Mission Sys...