Sciweavers

1578 search results - page 211 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
RT
1995
Springer
14 years 1 months ago
A Framework for Global Illumination in Animated Environments
We describe a new framework for efficiently computing and storing global illumination effects for complex, animated environments. The new framework allows the rapid generation of ...
Jeffry Nimeroff, Julie Dorsey, Holly E. Rushmeier
CVPR
2010
IEEE
14 years 15 days ago
Robust Piecewise-Planar 3D Reconstruction and Completion from Large-Scale Unstructured Point Data
In this paper, we present a novel method, the first to date to our knowledge, which is capable of directly and automatically producing a concise and idealized 3D representation f...
Anne-Laure Chauve, Patrick Labatut, Jean-Philippe ...
COMCOM
2004
84views more  COMCOM 2004»
13 years 10 months ago
A self-extracting accurate modeling for bounded-delay video services
This article proposes the XGOP-B deterministic traffic model for MPEG video services requiring strict bounds on the quality of service provided by the network. The XGOP-B model ta...
Marcelo Dias de Amorim, Otto Carlos Muniz Bandeira...
FMSD
2002
107views more  FMSD 2002»
13 years 10 months ago
Verification of Out-Of-Order Processor Designs Using Model Checking and a Light-Weight Completion Function
We present a new technique for verification of complex hardware devices that allows both generality andahighdegreeofautomation.Thetechniqueisbasedonournewwayofconstructinga"li...
Sergey Berezin, Edmund M. Clarke, Armin Biere, Yun...
SCN
2010
Springer
122views Communications» more  SCN 2010»
13 years 8 months ago
Recursive Lattice Reduction
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
Thomas Plantard, Willy Susilo