Sciweavers

241 search results - page 25 / 49
» The limitation of Bayesianism
Sort
View
NIPS
2000
13 years 11 months ago
Sparse Representation for Gaussian Process Models
We develop an approach for a sparse representation for Gaussian Process (GP) models in order to overcome the limitations of GPs caused by large data sets. The method is based on a...
Lehel Csató, Manfred Opper
ICASSP
2010
IEEE
13 years 10 months ago
Sparse signal recovery in the presence of correlated multiple measurement vectors
Sparse signal recovery algorithms utilizing multiple measurement vectors (MMVs) are known to have better performance compared to the single measurement vector case. However, curre...
Zhilin Zhang, Bhaskar D. Rao
INFORMATICALT
2006
89views more  INFORMATICALT 2006»
13 years 10 months ago
Investigation of Examples of E-Education Environment for Scientific Collaboration and Distance Graduate Studies, Part 1
The objective is to investigate two emerging information technologies in graduate studies and scientific cooperation. Internet is the first technology. The open source is the secon...
Jonas Mockus
JMLR
2002
102views more  JMLR 2002»
13 years 9 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 10 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson