图 书 馆开课单位--埃因霍温理工大学
1 1/1
1The Primal-Dual approach for Online Algorithms[在线算法的原始对偶方法]
Nikhil Bansal(埃因霍温理工大学) Online algorithms deal with settings where the input data arrives over time and the current decision must be made by the algo- rithm without the know...
热度：107
Nikhil Bansal(埃因霍温理工大学) Online algorithms deal with settings where the input data arrives over time and the current decision must be made by the algo- rithm without the know...
热度：107
2RoboEarth: Connecting robots world-wide[RoboEarth:连接机器人世界]
Heico Sandee(埃因霍温理工大学) At its core, RoboEarth is a World Wide Web for robots: a giant network and database repository where robots can share information and learn from each ...
热度：59
Heico Sandee(埃因霍温理工大学) At its core, RoboEarth is a World Wide Web for robots: a giant network and database repository where robots can share information and learn from each ...
热度：59
3Using TAPT as an Analytical Method for Understanding Online Experiences[使用TAPT作为了解在线体验的一种分析方法]
Clare J. Hooper(埃因霍温理工大学) There are various methods for understanding user experiences, but many of these focus on explicit and not implicit aspects. Teasing Apart, Piecing Tog...
热度：56
Clare J. Hooper(埃因霍温理工大学) There are various methods for understanding user experiences, but many of these focus on explicit and not implicit aspects. Teasing Apart, Piecing Tog...
热度：56
4Contour Enhancement and Completion via Left Invariant Evolution Equations on SE(2)[轮廓增强和完成通过在SE留下不变的进化方程(2)]
Remco Duits(埃因霍温理工大学)
热度：46
Remco Duits(埃因霍温理工大学)
热度：46
5Mining All Non-Derivable Frequent Itemsets[挖掘所有不可派生的频繁项集]
Toon Calders(埃因霍温理工大学) All frequent itemset mining algorithms rely heavily on the monotonicity principle for pruning. This principle allows for excluding candidate itemsets ...
热度：41
Toon Calders(埃因霍温理工大学) All frequent itemset mining algorithms rely heavily on the monotonicity principle for pruning. This principle allows for excluding candidate itemsets ...
热度：41
1 1/1