Sciweavers

5864 search results - page 206 / 1173
» Can We Work around Numerical Methods
Sort
View
DAGM
2006
Springer
15 years 8 months ago
Robust Variational Segmentation of 3D Objects from Multiple Views
We propose a probabilistic formulation of 3D segmentation given a series of images from calibrated cameras. Instead of segmenting each image separately in order to build a 3D surfa...
Kalin Kolev, Thomas Brox, Daniel Cremers
ICCS
2009
Springer
15 years 11 months ago
On the Origin of Grid Species: The Living Application
We present the living application, a method to autonomously manage applications on the grid. During its execution on the grid, the living application makes choices on the resources...
Derek Groen, Stefan Harfst, Simon Portegies Zwart
ICML
2007
IEEE
16 years 5 months ago
Simpler core vector machines with enclosing balls
The core vector machine (CVM) is a recent approach for scaling up kernel methods based on the notion of minimum enclosing ball (MEB). Though conceptually simple, an efficient impl...
András Kocsor, Ivor W. Tsang, James T. Kwok
NAACL
2007
15 years 6 months ago
Are Very Large N-Best Lists Useful for SMT?
This paper describes an efficient method to extract large n-best lists from a word graph produced by a statistical machine translation system. The extraction is based on the k sh...
Sasa Hasan, Richard Zens, Hermann Ney
125
Voted
PE
2000
Springer
101views Optimization» more  PE 2000»
15 years 4 months ago
On the convergence of the power series algorithm
In this paper we study the convergence properties of the power series algorithm, which is a general method to determine (functions of) stationary distributions of Markov chains. W...
Gerard Hooghiemstra, Ger Koole