Sciweavers

10997 search results - page 105 / 2200
» On the Structure of Complete Sets
Sort
View
DATE
2007
IEEE
91views Hardware» more  DATE 2007»
16 years 11 days ago
Transient fault prediction based on anomalies in processor events
Future microprocessors will be highly susceptible to transient errors as the sizes of transistors decrease due to CMOS scaling. Prior techniques advocated full scale structural or...
Satish Narayanasamy, Ayse Kivilcim Coskun, Brad Ca...
UAI
2000
15 years 7 months ago
Tractable Bayesian Learning of Tree Belief Networks
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
Marina Meila, Tommi Jaakkola
DATASCIENCE
2002
71views more  DATASCIENCE 2002»
15 years 5 months ago
An integrated web resource for crystallography
A recurring theme during the CODATA 2000 conference (Lake Maggiore, Italy, 15 - 19 October 2000) was the increasing convergence in data-rich branches of science between the storag...
Brian McMahon
ICML
2000
IEEE
16 years 6 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
AAAI
2011
14 years 6 months ago
Markov Logic Sets: Towards Lifted Information Retrieval Using PageRank and Label Propagation
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
Marion Neumann, Babak Ahmadi, Kristian Kersting