Sciweavers

19320 search results - page 330 / 3864
» On the complexity of computing determinants
Sort
View
IUI
2004
ACM
16 years 5 days ago
BioSonics: sensual explorations of a complex system
Complex systems abound in nature and are becoming increasingly important in artificial systems. The understanding and controlling of such systems is a major challenge. This paper ...
Daniel Bisig
RT
2001
Springer
15 years 11 months ago
Interactive Distributed Ray Tracing of Highly Complex Models
Abstract. Many disciplines must handle the creation, visualization, and manipulation of huge and complex 3D environments. Examples include large structural and mechanical engineeri...
Ingo Wald, Philipp Slusallek, Carsten Benthin, Mar...
WSCG
2004
185views more  WSCG 2004»
15 years 8 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang
ENTCS
2006
153views more  ENTCS 2006»
15 years 6 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
IANDC
2010
68views more  IANDC 2010»
15 years 5 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr