Sciweavers

1054 search results - page 46 / 211
» Fast Approximated SIFT
Sort
View
WEA
2005
Springer
117views Algorithms» more  WEA 2005»
15 years 3 months ago
Vertex Cover Approximations: Experiments and Observations
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
Eyjolfur Asgeirsson, Clifford Stein
APJOR
2010
112views more  APJOR 2010»
14 years 10 months ago
Sample Average Approximation Methods for a Class of Stochastic Variational inequality Problems
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existenc...
Huifu Xu
TCSV
2002
88views more  TCSV 2002»
14 years 9 months ago
Variable complexity DCT approximations driven by an HVQ-based analyzer
Transform approximations are explored for speeding up the software compression of images and video. Approximations are used to replace the regular discrete cosine transform (DCT) w...
Ricardo L. de Queiroz
ICML
2005
IEEE
15 years 10 months ago
Compact approximations to Bayesian predictive distributions
We provide a general framework for learning precise, compact, and fast representations of the Bayesian predictive distribution for a model. This framework is based on minimizing t...
Edward Snelson, Zoubin Ghahramani
PG
2000
IEEE
15 years 2 months ago
Interpolating and Approximating Moving Frames Using B-splines
The representation of moving geometry entities is an important issue in the fields of CAD/CAM and robotics motion design. We present a method to interpolate the moving frame homog...
Lizhuang Ma, Tony K. Y. Chan, Zhongding Jiang