Sciweavers

1022 search results - page 102 / 205
» Logspace Complexity of Functions and Structures
Sort
View
VMV
2003
151views Visualization» more  VMV 2003»
14 years 11 months ago
Optimized Spatial Hashing for Collision Detection of Deformable Objects
We propose a new approach to collision and self– collision detection of dynamically deforming objects that consist of tetrahedrons. Tetrahedral meshes are commonly used to repre...
Matthias Teschner, Bruno Heidelberger, Matthias M&...

Publication
4052views
16 years 11 months ago
On the Extraction of Curve Skeletons using Gradient Vector Flow
In this paper, we propose a new variational framework for computing continuous curve skeletons from discrete objects that are suitable for structural shape representation. We have...
M. Sabry Hassouna, Aly A. Farag
MST
1998
76views more  MST 1998»
14 years 9 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
MICCAI
2010
Springer
14 years 8 months ago
Detecting Brain Activation in fMRI Using Group Random Walker
Due to the complex noise structure of functional magnetic resonance imaging (fMRI) data, methods that rely on information within a single subject often results in unsatisfactory fu...
Bernard Ng, Ghassan Hamarneh, Rafeef Abugharbieh
SIAMCOMP
2011
14 years 4 months ago
The Chow Parameters Problem
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
Ryan O'Donnell, Rocco A. Servedio