13603 search results - page 342 / 2721 » On the Computational Complexity of Cut-Reduction |
217
Voted
IMR
2003
Springer
16 years 21 days ago
2003
Springer
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
193
click to vote
COMPLEX
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. We study the nonequilibrium phenomena of a coupled active rotator model in complex networks. From a numerical Langevin simulation, we find the peculiar phase transition ...
206
Voted
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
This article addresses the problem of real-time visual tracking in presence of complex motion blur. Previous authors have observed that efficient tracking can be obtained by match...
225
Voted
HAPTICS
2009
IEEE
16 years 2 months ago
2009
IEEE
The force-update-rate requirements of transparent rendering of virtual environments are in conflict with the computational cost required for computing complex interactions betwee...
199
Voted
IWPEC
2009
Springer
16 years 2 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...