Sciweavers

6110 search results - page 363 / 1222
» Approximate Computing
Sort
View
ICALP
2005
Springer
16 years 8 days ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
ICCS
2007
Springer
15 years 10 months ago
Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets
Abstract. Interpolating scattered data points is a problem of wide ranging interest. One of the most popular interpolation methods in geostatistics is ordinary kriging. The price f...
Nargess Memarsadeghi, David M. Mount
CVPR
1999
IEEE
16 years 8 months ago
Factorization as a Rank 1 Problem
Tomasi and Kanade [1] introduced the factorization method for recovering 3D structure from 2D video. In their formulation, the 3D shape and 3D motion are computed by using an SVD ...
Pedro M. Q. Aguiar, José M. F. Moura
SI3D
2005
ACM
16 years 9 days ago
Adaptive sampling of intersectable models exploiting image and object-space coherence
We present a sampling strategy and rendering framework for intersectable models, whose surface is implicitly defined by a black box intersection test that provides the location a...
Anders Adamson, Marc Alexa, Andrew Nealen
SIGGRAPH
1993
ACM
15 years 10 months ago
Radiosity algorithms using higher order finite element methods
Many of the current radiosity algorithms create a piecewise constant approximation to the actual radiosity. Through interpolation and extrapolation, a continuous solution is obtai...
Roy Troutman, Nelson L. Max