图 书 馆开课单位--斯坦福大学
171
172
173
174
175
176
177
178
179
180
171Supervised Clustering[监督聚类]
Reza Bosagh Zadeh(斯坦福大学) Despite the ubiquity of clustering as a tool in unsupervised learning, there is not yet a consensus on a formal theory, and the vast majority of work ...
热度：196
Reza Bosagh Zadeh(斯坦福大学) Despite the ubiquity of clustering as a tool in unsupervised learning, there is not yet a consensus on a formal theory, and the vast majority of work ...
热度：196
172On the Convexity of Latent Social Network Inference[论潜在社会网络推理的凸性]
Seth A. Myers(斯坦福大学) In many real-world scenarios, it is nearly impossible to collect explicit social network data. In such cases, whole networks must be inferred from und...
热度：57
Seth A. Myers(斯坦福大学) In many real-world scenarios, it is nearly impossible to collect explicit social network data. In such cases, whole networks must be inferred from und...
热度：57
173Numerical Methods for Solving Least Squares Problems with Constraints[带约束最小二乘问题的数值求解方法]
Gene Golub(斯坦福大学) In this talk, we discuss the problem of solving linear least squares problems and Total Least Squares problems with linear constraints and/or a quadra...
热度：83
Gene Golub(斯坦福大学) In this talk, we discuss the problem of solving linear least squares problems and Total Least Squares problems with linear constraints and/or a quadra...
热度：83
174Bayesian Analysis of Markov Chains [马尔可夫链的贝叶斯分析]
Persi Diaconis(斯坦福大学) Suppose we observe data and want to test if it comes from a Markov chain. If it does, we may want to estimate the transition operator. Working in a Ba...
热度：49
Persi Diaconis(斯坦福大学) Suppose we observe data and want to test if it comes from a Markov chain. If it does, we may want to estimate the transition operator. Working in a Ba...
热度：49
175Low-rank modeling[低阶建模]
Emmanuel Candes(斯坦福大学) Inspired by the success of compressive sensing, the last three years have seen an explosion of research in the theory of low-rank modeling. By now, we...
热度：82
Emmanuel Candes(斯坦福大学) Inspired by the success of compressive sensing, the last three years have seen an explosion of research in the theory of low-rank modeling. By now, we...
热度：82
176A Bayesian approach to Word Segmentation: Theoretical and Experimental results[贝叶斯分词方法：理论和实验结果]
Sharon Goldwater(斯坦福大学) Word segmentation. One of the first problems infants must solve when learning language. Infants make use of many different cues - phonotactics, allop...
热度：35
Sharon Goldwater(斯坦福大学) Word segmentation. One of the first problems infants must solve when learning language. Infants make use of many different cues - phonotactics, allop...
热度：35
177Unsupervised Learning of Syntactic Structure[无监督学习的句法结构]
Chris Manning(斯坦福大学) Probabilistic models of language. ''Everybody knows that language is variable'' - Sapir (1921). \\ Probabilistic models give precise descriptions of a...
热度：39
Chris Manning(斯坦福大学) Probabilistic models of language. ''Everybody knows that language is variable'' - Sapir (1921). \\ Probabilistic models give precise descriptions of a...
热度：39
178The Lucifer Effect: Understanding How Good People Turn Evil[路西法效应：了解好人如何变坏]
Philip Zimbardo(斯坦福大学) Perhaps no one comprehends the roots of depravity and cruelty better than Philip Zimbardo. He is renowned for such research as the Stanford Prison Exp...
热度：155
Philip Zimbardo(斯坦福大学) Perhaps no one comprehends the roots of depravity and cruelty better than Philip Zimbardo. He is renowned for such research as the Stanford Prison Exp...
热度：155
179Reflections[思考]
George P. Shultz(斯坦福大学) Former Secretary of State and MIT alum, George Shultz returned to MIT to accept the Robert A. Muh Award for his noteworthy achievements. In this talk ...
热度：44
George P. Shultz(斯坦福大学) Former Secretary of State and MIT alum, George Shultz returned to MIT to accept the Robert A. Muh Award for his noteworthy achievements. In this talk ...
热度：44
180The cognitive complexity of OWL justifications[OWL辩护的认知复杂性]
Matthew Horridge(斯坦福大学) In this paper, we present an approach to determining the cognitive complexity of justifications for entailments of OWL ontologies. We introduce a simp...
热度：36
Matthew Horridge(斯坦福大学) In this paper, we present an approach to determining the cognitive complexity of justifications for entailments of OWL ontologies. We introduce a simp...
热度：36