Sciweavers

680 search results - page 136 / 136
» Complexity of Strict Implication
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 27 days ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
WSDM
2012
ACM
283views Data Mining» more  WSDM 2012»
12 years 21 days ago
The life and death of online groups: predicting group growth and longevity
We pose a fundamental question in understanding how to identify and design successful communities: What factors predict whether a community will grow and survive in the long term?...
Sanjay Ram Kairam, Dan J. Wang, Jure Leskovec
CISS
2008
IEEE
13 years 11 months ago
Information theory based estimator of the number of sources in a sparse linear mixing model
—In this paper we present an Information Theoretic Estimator for the number of sources mutually disjoint in a linear mixing model. The approach follows the Minimum Description Le...
Radu Balan
COMPGEOM
2010
ACM
13 years 10 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
BMCBI
2010
119views more  BMCBI 2010»
13 years 5 months ago
Multi-task learning for cross-platform siRNA efficacy prediction: an in-silico study
Background: Gene silencing using exogenous small interfering RNAs (siRNAs) is now a widespread molecular tool for gene functional study and new-drug target identification. The key...
Qi Liu, Qian Xu, Vincent Wenchen Zheng, Hong Xue, ...