Sciweavers

1996 search results - page 163 / 400
» Financial Theory 2
Sort
View
RSA
2008
94views more  RSA 2008»
15 years 4 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski
SIAMSC
2010
117views more  SIAMSC 2010»
15 years 2 months ago
Least-Squares Finite Element Methods for Quantum Electrodynamics
A significant amount of the computational time in large Monte Carlo simulations of lattice field theory is spent inverting the discrete Dirac operator. Unfortunately, traditional...
James J. Brannick, C. Ketelsen, Thomas A. Manteuff...
SMC
2010
IEEE
132views Control Systems» more  SMC 2010»
15 years 2 months ago
Selection of SIFT feature points for scene description in robot vision
This paper presents a method for selection of SIFT(Scale-Invariant Feature Transform) feature points using OC-SVM (One Class-Support Vector Machines). We proposed the method for au...
Yuya Utsumi, Masahiro Tsukada, Hirokazu Madokoro, ...
ICIP
2009
IEEE
15 years 2 months ago
Two-dimensional geometric lifting
Wavelets provide a sparse representation for piecewise smooth signals in 1-D; however, separable extensions of wavelets to multiple dimensions do not achieve the same level of spa...
Joshua Blackburn, Minh N. Do
ECCV
2010
Springer
15 years 1 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...