8431 search results - page 1234 / 1687 » Algorithmically Independent Sequences |
150
click to vote
TIT
1998
15 years 6 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
188
click to vote
ICML
2001
IEEE
16 years 7 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...
271
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...
192
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
274
click to vote
SIGMOD
2006
ACM
16 years 7 months ago
2006
ACM
Recent data stream systems such as TelegraphCQ have employed the well-known property of duality between data and queries. In these systems, query processing methods are classified...