Sciweavers

8196 search results - page 1264 / 1640
» Computational Modeling and Complexity Science
Sort
View
GRAPHICSINTERFACE
2007
15 years 7 months ago
Constrained planar remeshing for architecture
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
Barbara Cutler, Emily Whiting
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 6 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
CGF
2007
158views more  CGF 2007»
15 years 6 months ago
Soft Articulated Characters with Fast Contact Handling
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
Nico Galoppo, Miguel A. Otaduy, Serhat Tekin, Mark...
JCP
2008
216views more  JCP 2008»
15 years 6 months ago
Direct Anonymous Attestation for Next Generation TPM
Trusted computing platforms have been proposed as a promising approach to enhance the security of general-purpose computing systems. Direct Anonymous Attestation(DAA) is a scheme t...
Xiaofeng Chen 0004, Dengguo Feng
CGF
2010
171views more  CGF 2010»
15 years 2 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
« Prev « First page 1264 / 1640 Last » Next »