Sciweavers

6274 search results - page 654 / 1255
» From query complexity to computational complexity
Sort
View
CRYPTO
1989
Springer
163views Cryptology» more  CRYPTO 1989»
15 years 11 months ago
Undeniable Signatures
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
David Chaum, Hans Van Antwerpen
175
Voted
AAAI
2008
15 years 9 months ago
Latent Tree Models and Approximate Inference in Bayesian Networks
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
Yi Wang, Nevin Lianwen Zhang, Tao Chen
CSCW
2008
ACM
15 years 9 months ago
CoMaya: incorporating advanced collaboration capabilities into 3d digital media design tools
Complex 3D digital media creation demands anytime and anywhere collaboration support. The CoMaya project aims to incorporate such advanced collaboration capabilities into Autodesk...
Agustina Agustina, Fei Liu, Steven Xia, Haifeng Sh...
GEOINFO
2007
15 years 8 months ago
Polygon Clipping and Polygon Reconstruction
Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against...
Leonardo Guerreiro Azevedo, Ralf Hartmut Güti...
209
Voted
VMV
2008
164views Visualization» more  VMV 2008»
15 years 8 months ago
Vector Glyphs for Surfaces: A Fast and Simple Glyph Placement Algorithm for Adaptive Resolution Meshes
Visualization of flow on boundary surfaces from computational flow dynamics (CFD) is challenging due to the complex, adaptive resolution nature of the meshes used in the modeling ...
Zhenmin Peng, Robert S. Laramee