3134 search results - page 192 / 627 » Computing full disjunctions |
103
click to vote
GRAPHITE
2005
ACM
15 years 9 months ago
2005
ACM
The computational requirements of full global illumination rendering are such that it is still not possible to achieve high-fidelity graphics of very complex scenes in a reasonab...
144
click to vote
SIGGRAPH
2010
ACM
15 years 8 months ago
2010
ACM
Simulating fluids based on vortex filaments is highly attractive for the creation of special effects because it gives artists full control over the simulation using familiar too...
175
Voted
AROBOTS
2006
15 years 3 months ago
2006
This article presents a very efficient SLAM algorithm that works by hierarchically dividing a map into local regions and subregions. At each level of the hierarchy each region sto...
131
click to vote
RAID
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Over the past few years, virtualization has been employed to environments ranging from densely populated cloud computing clusters to home desktop computers. Security rese...
163
click to vote
COMPGEOM
2007
ACM
15 years 5 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...