Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
6,613
THE PARAMETRIZED ALGORITHM FOR HAMILTONIAN MATRICES
"... Abstract. The heart of the implicitly restarted symplectic Lanczos method for Hamiltonian matrices consists of the algorithm, a structure-preserving algorithm for computing the spectrum of Hamiltonian matrices. The symplectic Lanczos method projects the large, sparse Hamiltonian matrix onto a small, ..."
Abstract
- Add to MetaCart
Abstract. The heart of the implicitly restarted symplectic Lanczos method for Hamiltonian matrices consists of the algorithm, a structure-preserving algorithm for computing the spectrum of Hamiltonian matrices. The symplectic Lanczos method projects the large, sparse Hamiltonian matrix onto a small
Efficient region tracking with parametric models of geometry and illumination
- PAMI
, 1998
"... Abstract—As an object moves through the field of view of a camera, the images of the object may change dramatically. This is not simply due to the translation of the object across the image plane. Rather, complications arise due to the fact that the object undergoes changes in pose relative to the v ..."
Abstract
-
Cited by 563 (30 self)
- Add to MetaCart
for handling the geometric distortions produced by changes in pose. We then combine geometry and illumination into an algorithm that tracks large image regions using no more computation than would be required to track with no accommodation for illumination changes. Finally, we augment these methods
An Efficient Parametric Algorithm for Octree Traversal
- Journal of WSCG
, 2000
"... An octree is a well known hierarchical spatial structure which is widely used in Computer Graphics algorithms. One of the most frequent operations is the computation of the octree voxels intersected by a straight line. This has a number of applications, such as ray-object intersection tests speed- ..."
Abstract
-
Cited by 32 (4 self)
- Add to MetaCart
An octree is a well known hierarchical spatial structure which is widely used in Computer Graphics algorithms. One of the most frequent operations is the computation of the octree voxels intersected by a straight line. This has a number of applications, such as ray-object intersection tests speed
An Efficient Parametric Algorithm for Octree Traversal
"... An octree is a well known hierarchical spatial structure which is widely used in Computer Graphics algorithms. One of the most frequent operations is the computation of the octree voxels intersected by a straight line. This has a number of applications, such as ray-object intersection tests speed-up ..."
Abstract
- Add to MetaCart
An octree is a well known hierarchical spatial structure which is widely used in Computer Graphics algorithms. One of the most frequent operations is the computation of the octree voxels intersected by a straight line. This has a number of applications, such as ray-object intersection tests speed
Parametrized algorithms for random serial dictatorship
- Mathematical Social Sciences
, 2014
"... ar ..."
Non-parametric Algorithms in Data Reduction at RATAN-600
"... Abstract. Non-linear and non-parametric algorithms for data averaging, smoothing and clipping in the RATAN-600 flexible astronomical data processing system are proposed. Algorithms are based on robust methods and non-linear filters using an iterative approach to smoothing and clipping. Using robust ..."
Abstract
- Add to MetaCart
Abstract. Non-linear and non-parametric algorithms for data averaging, smoothing and clipping in the RATAN-600 flexible astronomical data processing system are proposed. Algorithms are based on robust methods and non-linear filters using an iterative approach to smoothing and clipping. Using robust
Statistical Comparisons of Classifiers over Multiple Data Sets
, 2006
"... While methods for comparing two learning algorithms on a single data set have been scrutinized for quite some time already, the issue of statistical tests for comparisons of more algorithms on multiple data sets, which is even more essential to typical machine learning studies, has been all but igno ..."
Abstract
-
Cited by 744 (0 self)
- Add to MetaCart
While methods for comparing two learning algorithms on a single data set have been scrutinized for quite some time already, the issue of statistical tests for comparisons of more algorithms on multiple data sets, which is even more essential to typical machine learning studies, has been all
Non-parametric Algorithms in Data Reduction at RATAN-600
"... . Non-linear and non-parametric algorithms for data averaging, smoothing and clipping in the RATAN-600 flexible astronomical data processing system are proposed. Algorithms are based on robust methods and non-linear filters using an iterative approach to smoothing and clipping. Using robust procedur ..."
Abstract
- Add to MetaCart
. Non-linear and non-parametric algorithms for data averaging, smoothing and clipping in the RATAN-600 flexible astronomical data processing system are proposed. Algorithms are based on robust methods and non-linear filters using an iterative approach to smoothing and clipping. Using robust
A Parametric Texture Model based on Joint Statistics of Complex Wavelet Coefficients
- INTERNATIONAL JOURNAL OF COMPUTER VISION
, 2000
"... We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We de ..."
Abstract
-
Cited by 424 (13 self)
- Add to MetaCart
develop an efficient algorithm for synthesizing random images subject to these constraints, by iteratively projecting onto the set of images satisfying each constraint, and we use this to test the perceptual validity of the model. In particular, we demonstrate the necessity of subgroups of the parameter
Results 1 - 10
of
6,613
