Sciweavers

6274 search results - page 491 / 1255
» From query complexity to computational complexity
Sort
View
HT
1996
ACM
15 years 11 months ago
The HyperDisco Approach to Open Hypermedia Systems
Computing support forlargeengineeringenterprisesprovides an example of the need for hypermedia-based collaborative computing systems composed of a large number of distributed hete...
Uffe Kock Wiil, John J. Leggett
CGF
2007
158views more  CGF 2007»
15 years 7 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...
COMGEO
2002
ACM
15 years 6 months ago
Quadtree, ray shooting and approximate minimum weight Steiner triangulation
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
Siu-Wing Cheng, Kam-Hing Lee
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 7 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
CHI
1998
ACM
15 years 11 months ago
The Progress Portfolio: Designing Reflective Tools for a Classroom Context
A great deal of effort has gone into developing open-ended inquiry activities for science education as well as complex computer tools for accessing scientific data to help student...
Ben Loh, Josh Radinsky, Eric Russell, Louis M. Gom...