Sciweavers

4377 search results - page 372 / 876
» Mass problems and randomness
Sort
View
SIGIR
2008
ACM
15 years 6 months ago
A simple and efficient sampling method for estimating AP and NDCG
We consider the problem of large scale retrieval evaluation. Recently two methods based on random sampling were proposed as a solution to the extensive effort required to judge te...
Emine Yilmaz, Evangelos Kanoulas, Javed A. Aslam
ICML
2007
IEEE
16 years 7 months ago
Gradient boosting for kernelized output spaces
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 7 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
DCC
2007
IEEE
16 years 6 months ago
Towards generating secure keys for braid cryptography
Abstract. Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. S...
Ki Hyoung Ko, Jang-Won Lee, Tony Thomas
PKDD
2009
Springer
129views Data Mining» more  PKDD 2009»
16 years 1 months ago
Considering Unseen States as Impossible in Factored Reinforcement Learning
Abstract. The Factored Markov Decision Process (FMDP) framework is a standard representation for sequential decision problems under uncertainty where the state is represented as a ...
Olga Kozlova, Olivier Sigaud, Pierre-Henri Wuillem...