Sciweavers

3172 search results - page 27 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
ISCA
2012
IEEE
232views Hardware» more  ISCA 2012»
12 years 1 months ago
RADISH: Always-on sound and complete race detection in software and hardware
Data-race freedom is a valuable safety property for multithreaded programs that helps with catching bugs, simplifying memory consistency model semantics, and verifying and enforci...
Joseph Devietti, Benjamin P. Wood, Karin Strauss, ...
SIAMJO
2010
246views more  SIAMJO 2010»
13 years 9 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
ICDM
2010
IEEE
146views Data Mining» more  ICDM 2010»
13 years 9 months ago
One-Class Matrix Completion with Low-Density Factorizations
Consider a typical recommendation problem. A company has historical records of products sold to a large customer base. These records may be compactly represented as a sparse custom...
Vikas Sindhwani, Serhat Selcuk Bucak, Jianying Hu,...
AAAI
2012
12 years 1 months ago
Transportability of Causal Effects: Completeness Results
The study of transportability aims to identify conditions under which causal information learned from experiments can be reused in a different environment where only passive obser...
Elias Bareinboim, Judea Pearl
ATAL
2007
Springer
14 years 5 months ago
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
James Atlas, Keith Decker