Sciweavers

562 search results - page 20 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
126
Voted
EUROCAST
2007
Springer
182views Hardware» more  EUROCAST 2007»
15 years 8 months ago
A k-NN Based Perception Scheme for Reinforcement Learning
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
José Antonio Martin H., Javier de Lope Asia...
124
Voted
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 9 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
109
Voted
LREC
2010
206views Education» more  LREC 2010»
15 years 4 months ago
Efficient Multilabel Classification Algorithms for Large-Scale Problems in the Legal Domain
In this paper we evaluate the performance of multilabel classification algorithms on the EUR-Lex database of legal documents of the European Union. On the same set of underlying d...
Eneldo Loza Mencía, Johannes Fürnkranz
133
Voted
TWC
2008
112views more  TWC 2008»
15 years 2 months ago
Design and Analysis of Cross-Layer Tree Algorithms for Wireless Random Access
In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on suc...
Xin Wang, Yingqun Yu, Georgios B. Giannakis
88
Voted
CEC
2005
IEEE
15 years 8 months ago
Incorporating a Metropolis method in a distribution estimation using Markov random field algorithm
Abstract- Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs)...
Siddhartha Shakya, John A. W. McCall, Deryck F. Br...