1871 search results - page 324 / 375 » The Ephemeral Pairing Problem |
119
click to vote
ICML
2000
IEEE
15 years 12 months ago
2000
IEEE
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...
WWW
2005
ACM
15 years 11 months ago
2005
ACM
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
WWW
2005
ACM
15 years 11 months ago
2005
ACM
This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items...
KDD
2008
ACM
15 years 11 months ago
2008
ACM
In this work, we address the problem of joint modeling of text and citations in the topic modeling framework. We present two different models called the Pairwise-Link-LDA and the ...
113
click to vote
KDD
2008
ACM
15 years 11 months ago
2008
ACM
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...