10182 search results - page 1684 / 2037 » Case Studies |
176
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
177
click to vote
EUROCRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
209
Voted
EPIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we propose an incremental item-based collaborative filtering algorithm. It works with binary ratings (sometimes also called implicit ratings), as it is typi...
184
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
189
click to vote
GCB
2009
Springer
15 years 10 months ago
2009
Springer
Abstract: Graphs are often used to describe and analyze the geometry and physicochemical composition of biomolecular structures, such as chemical compounds and protein active sites...