167 search results - page 21 / 34 » DiFacto: Distributed Factorization Machines |
137
Voted
HIPC
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. In this work we put into evidence how the memory performance of a WebServer machine may depend on the sharing induced by process migration. We considered a shared-bus sha...
163
Voted
CONCURRENCY
2000
15 years 3 months ago
2000
The 1990s are seeing the explosive growth of the Internet and Web-based information sharing and dissemination systems. The Internet is also showing a potential of forming of a sup...
158
click to vote
WWW
2011
ACM
14 years 10 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
124
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
—Using the well-known ATLAS and LAPACK dense linear algebra libraries, we demonstrate that the parallel management overhead (PMO) can grow with problem size on even statically sc...
97
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
The advent of the Beowulf cluster in 1994 provided dedicated compute cycles, i.e., supercomputing for the masses, as a cost-effective alternative to large supercomputers, i.e., su...