Sciweavers

2173 search results - page 251 / 435
» On the Values of Reducibility Candidates
Sort
View
UAI
2003
15 years 8 months ago
Active Collaborative Filtering
Collaborative filtering (CF) allows the preferences of multiple users to be pooled to make recommendations regarding unseen products. We consider in this paper the problem of onl...
Craig Boutilier, Richard S. Zemel, Benjamin M. Mar...
SODA
2000
ACM
83views Algorithms» more  SODA 2000»
15 years 8 months ago
Restructuring ordered binary trees
We consider the problem of restructuring an ordered binary tree T , preserving the in-order sequence of its nodes, so as to reduce its height to some target value h. Such a restru...
William S. Evans, David G. Kirkpatrick
USENIX
1994
15 years 7 months ago
Large Granularity Cache Coherence for Intermittent Connectivity
To function in mobile computing environments, distributed file systems must cope with networks that are slow, intermittent, or both. Intermittence vitiates the effectiveness of ca...
Lily B. Mummert, Mahadev Satyanarayanan

Publication
103views
15 years 8 months ago
How to Use Vectors for Representing Ground Expressions in the Implementations of the Language Refal
Most implementations of the language Refal represent ground expressions by doubly-linked lists, which results in low-cost concatenation. On the other hand, that representation nece...
Sergei M. Abramov, Sergei A. Romanenko
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 6 months ago
An Enhanced Search Technique for Managing Partial Coverage and Free Riding in P2P Networks
This paper presents a Q-learning based scheme for managing the partial coverage problem and the ill effects of free riding in unstructured P2P networks. Based on various parameter ...
Sabu M. Thampi, K. Chandra Sekaran