Sciweavers

1254 search results - page 193 / 251
» Making Hard Problems Harder
Sort
View
WSDM
2010
ACM
214views Data Mining» more  WSDM 2010»
14 years 6 months ago
Pairwise Interaction Tensor Factorization for Personalized Tag Recommendation
Tagging plays an important role in many recent websites. Recommender systems can help to suggest a user the tags he might want to use for tagging a specific item. Factorization mo...
Steffen Rendle, Lars Schmidt-Thieme
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 6 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
SPAA
2009
ACM
14 years 6 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
EUROSYS
2010
ACM
14 years 6 months ago
Splitter: A Proxy-based Approach for Post-Migration Testing of Web Applications
The benefits of virtualized IT environments, such as compute clouds, have drawn interested enterprises to migrate their applications onto new platforms to gain the advantages of ...
Xiaoning Ding, Hai Huang, Yaoping Ruan, Anees Shai...
EUROSYS
2007
ACM
14 years 6 months ago
Latency and bandwidth-minimizing failure detectors
Failure detectors are fundamental building blocks in distributed systems. Multi-node failure detectors, where the detector is tasked with monitoring N other nodes, play a critical...
Kelvin C. W. So, Emin Gün Sirer