Sciweavers

1439 search results - page 140 / 288
» Fast approximation of centrality
Sort
View
93
Voted
NIPS
2003
15 years 2 months ago
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
98
Voted
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 26 days ago
Descent methods for Nonnegative Matrix Factorization
In this paper, we present several descent methods that can be applied to nonnegative matrix factorization and we analyze a recently developped fast block coordinate method. We als...
Ngoc-Diep Ho, Paul Van Dooren, Vincent D. Blondel
85
Voted
CORR
2004
Springer
168views Education» more  CORR 2004»
15 years 19 days ago
Estimating Genome Reversal Distance by Genetic Algorithm
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
Andy Auyeung, Ajith Abraham
107
Voted
CORR
2002
Springer
132views Education» more  CORR 2002»
15 years 18 days ago
Robust Feature Selection by Mutual Information Distributions
Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address question...
Marco Zaffalon, Marcus Hutter
JMIV
2010
107views more  JMIV 2010»
14 years 7 months ago
Block Based Deconvolution Algorithm Using Spline Wavelet Packets
This paper proposes robust algorithms to deconvolve discrete noised signals and images. The solutions are derived as linear combinations of spline wavelet packets that minimize so...
Amir Averbuch, Valery A. Zheludev, Pekka Neittaanm...