Sciweavers

246 search results - page 45 / 50
» Bichain graphs: Geometric model and universal graphs
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 1 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
CORR
2010
Springer
182views Education» more  CORR 2010»
14 years 9 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...
SMA
2003
ACM
169views Solid Modeling» more  SMA 2003»
15 years 2 months ago
Surface reconstruction of freeform objects based on multiresolution volumetric method
3D scanners developed over the past several decades have facilitated the reconstruction of complicated engineering parts. Typically the boundary representation of a part is recons...
Sergei Azernikov, Alex Miropolsky, Anath Fischer
SIGGRAPH
1991
ACM
15 years 1 months ago
Visibility preprocessing for interactive walkthroughs
The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g....
Seth J. Teller, Carlo H. Séquin
SIGGRAPH
1997
ACM
15 years 1 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas