683 search results - page 57 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
MICCAI
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we propose a Markov random field (MRF) based method for joint registration and segmentation of cardiac perfusion images, specifically the left ventricle (LV). MRFs ...
ESOP
1999
Springer
14 years 4 days ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
STACS
1997
Springer
14 years 13 hour ago
1997
Springer
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
APIN
2008
13 years 8 months ago
2008
Abstract Traditional financial analysis systems utilize lowlevel price data as their analytical basis. For example, a decision-making system for stock predictions regards raw price...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...