Mapreduce & Hadoop Algorithms in Academic Papers | atbrox
The newest and most up-to-date version (May 2010) this blog post is available at http://mapreducebook.org An updated and extended version of this blog post can be found here. Motivation Learn from academic literature about how the mapreduce parallel model and hadoop implementation is used to solve algorithmic problems. Disclaimer: this is work in progress (look for updates) Input Data – Academic P
NIPS 2008 Proceedings
Advances in Neural Information Processing Systems 21 (NIPS 2008) The papers below appear in Advances in Neural Information Processing Systems 21 edited by D. Koller and D. Schuurmans and Y. Bengio and L. Bottou. They are proceedings from the conference, "Neural Information Processing Systems 2008." Structure Learning in Human Sequential Decision-Making Daniel Acuna, Paul R. Schrater The Gaussian P
Robert Plemmons | Emeritus Z. Smith Reynolds Professor of Mathematics and Computer Science, Wake Forest University
Robert Plemmons Emeritus Z. Smith Reynolds Professor of Mathematics and Computer Science, Wake Forest University (Last updated September 23, 2023) Robert J. Plemmons, Emeritus Z. Smith Reynolds Professor of Mathematics and Computer Science, joined the Wake Forest University faculty in 1990, and retired from teaching, but not research, in 2013. He is a Fellow of the Society for Industrial and Appli
Flow Map Layout
Abstract Cartographers have long used flow maps to show the movement of objects from one location to another, such as the number of people in a migration, the amount of goods being traded, or the number of packets in a network. The advantage of flow maps is that they reduce visual clutter by merging edges. Most flow maps are drawn by hand and there are few computer algorithms available. We present
Efficient Gradient-Domain Compositing Using Quadtrees
Abstract We describe a hierarchical approach to improving the efficiency of gradient-domain compositing , a technique that constructs seamless composites by combining the gradients of images into a vector field that is then integrated to form a composite. While gradient-domain compositing is powerful and widely used, it suffers from poor scalability. Computing an n pixel composite requires solving
1
ランã‚ング
ãŠçŸ¥ã‚‰ã›
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
scanvis05.dvi
時系列データã«å¯¾ã™ã‚‹åŠ¹æžœçš„ãªå¤–れ値検出手法
è·é›¢ã®å…¬ç†ã‚’満ãŸã•ãªã„類似度を用ã„ãŸã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°æ‰‹æ³•
http://kosara.net/papers/Kosara_TVCG_2006.pdf
Publications | Visual Computing Group - Prof. Dr. Oliver Deussen
{{#tags}}- {{label}}
{{/tags}}