3628 search results - page 655 / 726 » The Decision Diffie-Hellman Problem |
129
click to vote
IOR
2010
15 years 15 days ago
2010
The paper considers a stylized model of a dynamic assortment optimization problem, where given a limited capacity constraint, we must decide the assortment of products to offer to...
110
click to vote
TON
2010
14 years 10 months ago
2010
In this paper, we develop a distributed rate-control algorithm for networks with multiple unicast sessions when network coding is allowed across different sessions. Building on rec...
111
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
255
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
139
click to vote
ICML
2001
IEEE
16 years 4 months ago
2001
IEEE
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...