Sciweavers

7716 search results - page 99 / 1544
» Can I pass
Sort
View
SPAA
2010
ACM
16 years 9 days ago
Brief announcement: byzantine agreement with homonyms
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
ATAL
2008
Springer
15 years 9 months ago
A new approach to cooperative pathfinding
In the multi-agent pathfinding problem, groups of agents need to plan paths between their respective start and goal locations in a given environment, usually a two-dimensional map...
M. Renee Jansen, Nathan R. Sturtevant
CGF
2008
78views more  CGF 2008»
15 years 7 months ago
Single-pass Scalable Subsurface Rendering with Lightcuts
This paper presents a new, scalable, single pass algorithm for computing subsurface scattering using the diffusion approximation. Instead of pre-computing a globally conservative ...
Adam Arbree, Bruce Walter, Kavita Bala
CGF
2008
134views more  CGF 2008»
15 years 7 months ago
Sample Based Visibility for Soft Shadows using Alias-free Shadow Maps
This paper introduces an accurate real-time soft shadow algorithm that uses sample based visibility. Initially, we present a GPU-based alias-free hard shadow map algorithm that ty...
Erik Sintorn, Elmar Eisemann, Ulf Assarsson
ICIP
2002
IEEE
16 years 9 months ago
Low complexity guaranteed fit compound document compression
We propose a new, very low complexity, single-pass, algorithm for compression of continuous tone compound documents, known as GRAFIT (GuaRAnteed FIT) that can guarantee a minimum ...
Debargha Mukherjee, Christos Chrysafis, Amir Said