Sciweavers

3110 search results - page 286 / 622
» On the initialization of the DNMF algorithm
Sort
View
AIPS
2006
15 years 8 months ago
Scalable Planning for Distributed Stream Processing Systems
Recently the problem of automatic composition of workflows has been receiving increasing interest. Initial investigation has shown that designing a practical and scalable composit...
Anton Riabov, Zhen Liu
AIPS
2006
15 years 8 months ago
Fast Probabilistic Planning through Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Carmel Domshlak, Jörg Hoffmann
CCCG
2006
15 years 8 months ago
K-Nearest Neighbor Search using the Pyramid Technique
A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we in...
Bradford G. Nickerson, Qingxiu Shi
CCCG
2001
15 years 8 months ago
Nearest neighbor search through function minimization
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
Chang Shu, Michael A. Greenspan, Guy Godin
IJIT
2004
15 years 8 months ago
Multiresolution Approach to Subpixel Registration by Linear Approximation of PSF
Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of ...
Erol Seke, Kemal Özkan