Sciweavers

2088 search results - page 195 / 418
» The Probabilistic Method
Sort
View
108
Voted
SIGIR
2003
ACM
15 years 8 months ago
A maximal figure-of-merit learning approach to text categorization
A novel maximal figure-of-merit (MFoM) learning approach to text categorization is proposed. Different from the conventional techniques, the proposed MFoM method attempts to integ...
Sheng Gao, Wen Wu, Chin-Hui Lee, Tat-Seng Chua
ICASSP
2010
IEEE
15 years 2 months ago
A partially collapsed Gibbs sampler for parameters with local constraints
We consider Bayesian detection/classification of discrete random parameters that are strongly dependent locally due to some deterministic local constraint. Based on the recently ...
Georg Kail, Jean-Yves Tourneret, Franz Hlawatsch, ...
98
Voted
IJCAI
1993
15 years 4 months ago
The Statistical Learning of Accurate Heuristics
Heuristics used by search algorithms are usually composed of more primitive functions which we call "features". A method for combining features is presented which is bas...
Anna Bramanti-Gregor, Henry W. Davis
RANDOM
2001
Springer
15 years 8 months ago
Near-optimum Universal Graphs for Graphs with Bounded Degrees
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakaw...
GECCO
2008
Springer
142views Optimization» more  GECCO 2008»
15 years 4 months ago
Complexity of Max-SAT using stochastic algorithms
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
Mohamed Qasem, Adam Prügel-Bennett