Sciweavers

5329 search results - page 332 / 1066
» The Weighted Majority Algorithm
Sort
View
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
16 years 2 days ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez

Publication
464views
15 years 11 months ago
Fast image and video denoising via nonlocal means of similar neighborhoods
In this note, improvements to the non-local means image denoising method introduced in [2], [3] are presented. The original non-local means method replaces a noisy pixel by the ...
Mona Mahmoudi, Guillermo Sapiro
GECCO
2006
Springer
196views Optimization» more  GECCO 2006»
15 years 10 months ago
An anticipatory approach to improve XCSF
XCSF is a novel version of learning classifier systems (LCS) which extends the typical concept of LCS by introducing computable classifier prediction. In XCSF Classifier predictio...
Amin Nikanjam, Adel Torkaman Rahmani
COLING
2008
15 years 8 months ago
Homotopy-Based Semi-Supervised Hidden Markov Models for Sequence Labeling
This paper explores the use of the homotopy method for training a semi-supervised Hidden Markov Model (HMM) used for sequence labeling. We provide a novel polynomial-time algorith...
Gholamreza Haffari, Anoop Sarkar
ECIR
2008
Springer
15 years 8 months ago
Applying Maximum Entropy to Known-Item Email Retrieval
It is becoming increasingly common in information retrieval to combine evidence from multiple resources to compute the retrieval status value of documents. Although this has led to...
Sirvan Yahyaei, Christof Monz