901 search results - page 126 / 181 » Analyzing linear mergers |
104
Voted
LCPC
1998
Springer
15 years 3 months ago
1998
Springer
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
93
Voted
POPL
1996
ACM
15 years 3 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
BIRTHDAY
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. The Operational Transformation (OT) approach is a technique for supporting optimistic replication in collaborative and mobile systems. It allows the users to concurrently...
101
Voted
CONEXT
2007
ACM
15 years 2 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
81
Voted
KDD
2010
ACM
15 years 2 months ago
2010
ACM
We analyze the application of ensemble learning to recommender systems on the Netflix Prize dataset. For our analysis we use a set of diverse state-of-the-art collaborative filt...