Sciweavers

4218 search results - page 66 / 844
» Complete sets of cooperations
Sort
View
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 7 months ago
Acdmcp: An adaptive and completely distributed multi-hop clustering protocol for wireless sensor networks
Clustering is a very popular network structuring technique which mainly addresses the issue of scalability in large scale Wireless Sensor Networks. Additionally, it has been shown...
Khalid Nawaz, Alejandro P. Buchmann
BMCBI
2006
140views more  BMCBI 2006»
13 years 7 months ago
MACSIMS : multiple alignment of complete sequences information management system
Background: In the post-genomic era, systems-level studies are being performed that seek to explain complex biological systems by integrating diverse resources from fields such as...
Julie D. Thompson, Arnaud Muller, Andrew M. Waterh...
SIAMJO
2010
246views more  SIAMJO 2010»
13 years 6 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 5 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
11 years 10 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