Sciweavers

1048 search results - page 3 / 210
» Best Probabilistic Transformers
Sort
View
PVLDB
2010
151views more  PVLDB 2010»
13 years 9 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identiļ¬cation of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ļ...
Kathy Macropol, Ambuj K. Singh
AAAI
2007
14 years 1 months ago
Best-First Search for Treewidth
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
P. Alex Dow, Richard E. Korf
GECCO
2008
Springer
147views Optimization» more  GECCO 2008»
13 years 12 months ago
On selecting the best individual in noisy environments
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the ļ¬nal outcome of the evolutionary run. Trivial f...
Wojciech Jaskowski, Wojciech Kotlowski
ICIP
2009
IEEE
13 years 8 months ago
Best basis denoising with non-stationary wavelet packets
This article introduces a best basis search algorithm in a nonstationary (NS) wavelet packets dictionary. It computes an optimized labeled quad-tree that indexes the filters used ...
Nizar Ouarti, Gabriel Peyré
JCP
2007
143views more  JCP 2007»
13 years 10 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstractā€” We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio