图 书 馆开课单位--滑铁卢大学
1
2
3
4
5
6
7
8
9
10
1Portable In-Browser Data Cube Exploration[可移植的浏览器内数据立方体探索]
Kareem El Gebaly(滑铁卢大学) Data cubes, which summarize data across multiple dimensions, have been a staple of On Line Analytical Processing (OLAP) for well over a decade. While ...
热度：15
Kareem El Gebaly(滑铁卢大学) Data cubes, which summarize data across multiple dimensions, have been a staple of On Line Analytical Processing (OLAP) for well over a decade. While ...
热度：15
2A formal analysis of stability - lessons and open questions[稳定性的正式分析-经验教训和开放问题]
Shai Ben David(滑铁卢大学) A formal analysis of stability - lessons and open questions
热度：16
Shai Ben David(滑铁卢大学) A formal analysis of stability - lessons and open questions
热度：16
3Data-Intensive Text Processing with MapReduce[基于MapReduce的数据密集型文本处理]
Jimmy Lin(滑铁卢大学) Data-Intensive Text Processing with MapReduce.
热度：16
Jimmy Lin(滑铁卢大学) Data-Intensive Text Processing with MapReduce.
热度：16
4Combinatorial iterated integrals and the unipotent Torelli theorem for graphs[图的组合迭代积分和单能托雷利定理]
Eric Katz(滑铁卢大学) The classical Torelli theorem says that a Riemann surface can be recovered from its Jacobian, which is a principally polarized Abelian variety. There ...
热度：34
Eric Katz(滑铁卢大学) The classical Torelli theorem says that a Riemann surface can be recovered from its Jacobian, which is a principally polarized Abelian variety. There ...
热度：34
5Combinatorial iterated integrals and the unipotent Torelli theorem for graphs[图的组合迭代积分和单能Torelli定理]
Eric Katz(滑铁卢大学) The classical Torelli theorem says that a Riemann surface can be recovered from its Jacobian, which is a principally polarized Abelian variety. There ...
热度：32
Eric Katz(滑铁卢大学) The classical Torelli theorem says that a Riemann surface can be recovered from its Jacobian, which is a principally polarized Abelian variety. There ...
热度：32
6Succinct Data Structures[简洁的数据结构]
J. Ian Munro(滑铁卢大学) A succinct data structure is a representation of a combinatorial object that requires space close to the logarithm of the number of such objects of th...
热度：64
J. Ian Munro(滑铁卢大学) A succinct data structure is a representation of a combinatorial object that requires space close to the logarithm of the number of such objects of th...
热度：64
78A Concept-based Model for Enhancing Text Categorization[基于概念提高文本分类模型]
Shady Shehata(滑铁卢大学) Most of text categorization techniques are based on word and/or phrase analysis of the text. Statistical analysis of a term frequency captures the imp...
热度：58
Shady Shehata(滑铁卢大学) Most of text categorization techniques are based on word and/or phrase analysis of the text. Statistical analysis of a term frequency captures the imp...
热度：58
9Nonnegative Matrix Factorization via Rank-One Downdate[非负矩阵分解通过秩一停机日期]
Ali Ghodsi(滑铁卢大学) Nonnegative matrix factorization (NMF) was popularized as a tool for data mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with n...
热度：47
Ali Ghodsi(滑铁卢大学) Nonnegative matrix factorization (NMF) was popularized as a tool for data mining by Lee and Seung in 1999. NMF attempts to approximate a matrix with n...
热度：47
10Closing the Gap: Improved Bounds on Optimal POMDP Solutions[缩小差距：最优POMDP的解决方案改进的界限]
Pascal Poupart(滑铁卢大学) POMDP algorithms have made significant progress in recent years by allowing practitioners to find good solutions to increasingly large problems. Most ...
热度：68
Pascal Poupart(滑铁卢大学) POMDP algorithms have made significant progress in recent years by allowing practitioners to find good solutions to increasingly large problems. Most ...
热度：68