サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
買ってよかったもの
infolab.stanford.edu/~west1
[I moved to EPFL in December 2016, so this website isn't updated any longer. My new website lives at http://dlab.epfl.ch/people/west/.] Hi, I'm Robert West, but you can call me Bob, or His Bobness, or Bobber, or El Boberino if you're not into the whole brevity thing. My research aims to understand, predict, and enhance human behavior in social and information networks by developing techniques in d
infolab.stanford.edu/~ullman
Chapter 9 Recommendation Systems There is an extensive class of Web applications that involve predicting user responses to options. Such a facility is called a recommendation system. We shall begin this chapter with a survey of the most important examples of these systems. However, to bring the problem into focus, two good examples of recommendation systems are: 1. Offering news articles to on-lin
infolab.stanford.edu/~sergey
"Near Neighbor Search in Large Metric Spaces", S.Brin, Proceeding of Very Large Data Bases (VLDB) 1995. (html) "Copy Detection Mechanisms for Digital Documents", S. Brin, J. Davis, H. Garcia-Molina, ACM SIGMOD 1995. (html) GNAT's This project involved indexing multidimensional data for near-neighbor searches. The kind of applications I envision are identity comparisons, information finding, molecu
infolab.stanford.edu
GPS: A Graph Processing System Overview GPS is an open-source system for scalable, fault-tolerant, and easy-to-program execution of algorithms on extremely large graphs. GPS is similar to Google’s proprietary Pregel system, and Apache Giraph. GPS is a distributed system designed to run on a cluster of machines, such as Amazon's EC2. In systems such as GPS and Pregel, the input graph (directed, pos
The book has a new Web site www.mmds.org. This page will no longer be maintained. Your browser should be automatically redirected to the new site in 10 seconds. The book has now been published by Cambridge University Press. The publisher is offering a 20% discount to anyone who buys the hardcopy Here. By agreement with the publisher, you can still download it free from this page. Cambridge Press d
infolab.stanford.edu/~widom
TM Emerging Trends in Data Storage and Processing Kevin Weil -- @kevinweil Analytics Lead, Twitter Stanford CS 145 November 29, 2010 Monday, November 29, 2010 Giving a talk about SQL and NoSQL in CS145 at Stanford. Lots of ##s! 1 minute ago via Twitter for iPhone Retweeted by 1 person kevinweil Monday, November 29, 2010 Introduction ‣ A Review of SQL ‣ Pop Quiz ‣ Storing Tweets ‣ Serving Tweets ‣
1 The book has been moved to http://infolab.stanford.edu/~ullman/mmds.html It is still free. The new page allows you to select chapters without downloading the entire book. { Anand Rajaraman and Je Ullman
infolab.stanford.edu/~olston
The Anatomy of a Large-Scale Hypertextual Web Search Engine Sergey Brin and Lawrence Page Computer Science Department, Stanford University, Stanford, CA 94305, USA sergey@cs.stanford.edu and page@cs.stanford.edu Abstract In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the
A System for Integrated Management of Data, Uncertainty, and Lineage Overview Trio is a new kind of database management system: one in which data, uncertainty of the data, and data lineage are all first-class citizens. Trio is based on an extended relational model called ULDBs, and it supports a SQL-based query language called TriQL. (See the online TriQL Language Manual.) A wide variety of applic
This book has been taken out of print by W. H. Freeman. You are welcome to use it if you like. We believed in 1992 it was the way to introduce theory in Computer Science, and we believe that today. Index The Book | Materials | Gradiance | Errata PDF's of the Book Preface Table of Contents Chapter 1 Computer Science: The Mechanization of Abstraction Chapter 2 Iteration, Induction, and Recursion Cha
Please excuse the retro formatting. This page was created back in early days when raw HTML was the norm, for those of us who actually made web pages back then. I haven't bothered to modernize it, figuring it's the content that actually counts. Here are the notes from a presentation I gave at the Stanford InfoLab Friday lunch, 1/27/06, with a few (not many) revisions when I reprised the talk on 12/
This is the type of computer that went to the moon in the Apollo missions from 1969 to 1972. There was one computer in the Lunar Excursion Module (LEM) and one the mothership (CM) circling above. It was the first use of integrated circuits, as still displayed in the timeline cabinet to the left. It's cycle time was 1 Mhz, 11 instructions. It had 1K of 16 bit words of erasable (RAM) core memory and
The Stanford InfoLab has some newly refurbished lab space, thanks to a generous gift from Google! We had a Grand Opening ceremony on November 8, 2011. You can see some of the photos here (courtesy of Rick Barber). We've created a freely-available online version of our Introduction to Databases course; check out the OpenClassroom website. Materials include video mini-lectures (with in-video quizzes
Jeff Ullman is the Stanford W. Ascherman Professor of Computer Science (Emeritus). His interests include database theory, database integration, data mining, and education using the information infrastructure. What's New Third Edition of Mining of Massive Datasets The third edition is now available in hardcopy from Here. By agreement with Cambridge University Press, it may be downloaded gratis Here
Revised Edition Available Oct. 1, 2001 This book has been replaced by a larger book, Database Systems: The Complete Book, which includes updated material from this book and A First Course in Database Systems. Click here: for more information. Index Solutions to Selected Exercises Errata Slides Course Notes Book-Ordering Information The book Database System Implementation by Hector Garcia-Molina, J
Introduction to Automata Theory, Languages, and Computation Free Course in Automata Theory I have prepared a course in automata theory (finite automata, context-free grammars, decidability, and intractability), and it begins April 23, 2012. You can learn more about the course at www.coursera.org/course/automata. Several other courses will start at the same time, including Alex Aiken on Compilers,
infolab.stanford.edu/~wangz
Real-Time Computerized Annotation of Pictures Jia Li and James Z. Wang The Pennsylvania State University, University Park, PA 16802 Abstract: Automated annotation of digital pictures has been a highly challenging problem for computer scientists since the invention of computers. The capability of annotating pictures by computers can lead to breakthroughs in a wide range of applications including We
Welcome to the home page for Database Systems: The Complete Book (DS:CB), by Hector Garcia-Molina, Jeff Ullman, and Jennifer Widom. The second edition of this book was published on June 9, 2008. Some material on this page is also relevant to A First Course in Database Systems, 3nd Edition. The Gradiance contract with Pearson (Addison-Wesley + Prentice-Hall) has terminated, and we have decided to t
Sergey Brin's Home Page Ph.D. student in Computer Science at Stanford - sergey@cs.stanford.edu Currently I am at Google. In fall '98 I taught CS 349. Data Mining A major research interest is data mining and I run a meeting group here at Stanford. For more information take a look at the MIDAS home page or see the datamine maling list achive. Here are some recent publications: Extracting Patterns
The Original GOOGLE Computer Storage [Page and Brin] (1996) The development of the Google algorithms was carried on on a variety of Computers, mainly provided by the NSF-DARPA-NASA-funded Digital Library project at Stanford. Crawling the web to obtain its link structure required an enormous amount of storage in comparison with typical student projects at that time. We show here the original storag
infolab.stanford.edu/~backrub
Computer Science Department, Stanford University, Stanford, CA 94305 In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a full text and hyperlink database of at leas
このページを最初にブックマークしてみませんか?
『The Stanford University InfoLab』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く