Sciweavers

793 search results - page 51 / 159
» Efficient computation of the characteristic polynomial
Sort
View
CGF
2005
156views more  CGF 2005»
13 years 7 months ago
Efficient Animation of Point-Sampled Thin Shells
We present a novel framework for the efficient simulation and animation of discrete thin shells. Our method takes a point sampled surface as input and performs all necessary compu...
Martin Wicke, Denis Steinemann, Markus H. Gross
DCOSS
2005
Springer
14 years 1 months ago
Distributed Energy-Efficient Hierarchical Clustering for Wireless Sensor Networks
Abstract: Since nodes in a sensor network have limited energy, prolonging the network lifetime and improving scalability become important. In this paper, we propose a distributed w...
Ping Ding, JoAnne Holliday, Aslihan Celik
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
14 years 8 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
INFOCOM
2008
IEEE
14 years 2 months ago
A Practical and Flexible Key Management Mechanism For Trusted Collaborative Computing
—Trusted Collaborative Computing (TCC) is a new research and application paradigm. Two important challenges in such a context are represented by secure information transmission a...
Xukai Zou, Yuan-Shun Dai, Elisa Bertino
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 11 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...