2693 search results - page 378 / 539 » On Computing Complex Navigation Functions |
160
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
184
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Many applications require a computer representation of 2D shape, usually described by a set of 2D points. The challenge of this representation is that it must not only capture the...
184
click to vote
APPROX
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
178
click to vote
VLSID
2006
IEEE
16 years 11 days ago
2006
IEEE
This tutorial focuses on advanced techniques to cope with the complexity of designing modern digital chips which are complete systems often containing multiple processors, complex...
188
click to vote
DOLAP
2006
ACM
15 years 10 months ago
2006
ACM
As more and more information is available on the web, it is a problem that many web resources are not accessible, i.e., are not usable for users with special needs. For example, f...