Sciweavers

112 search results - page 23 / 23
» An Improved Bound on the Minimal Number of Edges in Color-Cr...
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 6 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
11 years 8 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...