Sciweavers

17541 search results - page 76 / 3509
» Complexity in scalable computing
Sort
View
CA
1998
IEEE
15 years 2 months ago
Interactive Animation of Soft Shadows
Shadows are of great importance to computer graphics, especially for interactive animation due to the visual cues which they provide. Most research in the field of dynamic shadowi...
Adam D. Worrall, David Hedley, Derek J. Paddon
CSC
2006
14 years 11 months ago
Parallel Load Balancing Heuristics for Radiative Heat Transfer Calculations
The computation of radiative effects by the Photon Monte Carlo method is computationally demanding, especially when complex, nongray absorption models are employed. To solve such c...
Kamal Viswanath, Ivana Veljkovic, Paul E. Plassman...
NDSS
2009
IEEE
15 years 4 months ago
Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases
Many existing privacy-preserving techniques for querying distributed databases of sensitive information do not scale for large databases due to the use of heavyweight cryptographi...
Sherman S. M. Chow, Jie-Han Lee, Lakshminarayanan ...
SIGMOD
2012
ACM
276views Database» more  SIGMOD 2012»
13 years 7 days ago
SCARAB: scaling reachability computation on large graphs
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
Ruoming Jin, Ning Ruan, Saikat Dey, Jeffrey Xu Yu
ISCC
2002
IEEE
144views Communications» more  ISCC 2002»
15 years 2 months ago
A hierarchical distributed protocol for MPLS path creation
Network service provisioning involves the control of network resources through signaling, routing and management protocols that achieve Quality of Service and Traffic Engineering ...
Mohamed El-Darieby, Dorina C. Petriu, Jerry Rolia