Sciweavers

855 search results - page 53 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
TCS
2010
14 years 4 months ago
A fluid analysis framework for a Markovian process algebra
Markovian process algebras, such as PEPA and stochastic -calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models gen...
Richard A. Hayden, Jeremy T. Bradley
SI3D
2006
ACM
15 years 3 months ago
Approximate ambient occlusion for trees
Natural scenes contain large amounts of geometry, such as hundreds of thousands or even millions of tree leaves and grass blades. Subtle lighting effects present in such environme...
Kyle Hegeman, Simon Premoze, Michael Ashikhmin, Ge...
EUROCRYPT
2009
Springer
15 years 10 months ago
Cube Attacks on Tweakable Black Box Polynomials
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
Itai Dinur, Adi Shamir
DC
2008
14 years 10 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
SIGGRAPH
1993
ACM
15 years 1 months ago
Interval methods for multi-point collisions between time-dependent curved surfaces
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
John M. Snyder, Adam R. Woodbury, Kurt W. Fleische...