How to Write a Video Player in Less Than 1000 Lines
An ffmpeg and SDL Tutorialor How to Write a Video Player in Less Than 1000 Lines UPDATE: This tutorial is up to date as of February 2015. ffmpeg is a wonderful library for creating video applications or even general purpose utilities. ffmpeg takes care of all the hard work of video processing by doing all the decoding, encoding, muxing and demuxing for you. This can make media applications much si
Visualizing Algorithms
The power of the unaided mind is highly overrated… The real powers come from devising external aids that enhance cognitive abilities. —Donald Norman Algorithms are a fascinating use case for visualization. To visualize an algorithm, we don’t merely fit data to a chart; there is no primary dataset. Instead there are logical rules that describe behavior. This may be why algorithm visualizations are
Problem Solving with Algorithms and Data Structures using Python — Problem Solving with Algorithms and Data Structures
Problem Solving with Algorithms and Data Structures using Python¶ By Brad Miller and David Ranum, Luther College Assignments There is a wonderful collection of YouTube videos recorded by Gerry Jenkins to support all of the chapters in this text. Acknowledgements¶ We are very grateful to Franklin Beedle Publishers for allowing us to make this interactive textbook freely available. This online versi
Coin change
The Coin Change problem is the problem of finding the number of ways of making changes for a particular amount of cents, , using a given set of denominations . It is a general case of Integer Partition, and can be solved with dynamic programming. (The Min-Coin Change is a common variation of this problem.) Overview[edit] The problem is typically asked as: If we want to make change for cents, and w
The Two Egg Problem
There痴 an interesting mind-teaser/puzzle that floats around the internet in waves. Sometimes it痴 described as a Google interview question; sometimes it痴 described as a Microsoft interview question. No matter of the origin, it痴 a fun little critical thinking puzzle and in this blog posting I知 going to look into it and take it a little further … You are given two eggs, and access to a 100-storey bui
stoimen's web log
Introduction Basically sorting algorithms can be divided into two main groups. Such based on comparisons and such that are not. I already posted about some of the algorithms of the first group. Insertion sort, bubble sort and Shell sort are based on the comparison model. The problem with these three algorithms is that their complexity is O(n2) so they are very slow. So is it possible to sort a lis
LensKit — Welcome
Research Use LensKit to research recommender algorithms, evaluation techniques, or user experience. Build Use LensKit to build your next recommender application. Get LensKit conda install -c conda-forge lenskit Or, if you prefer plain Pip: pip install lenskit If you use LensKit in research, please cite the paper. Learn about LensKit Read the documentation Read the paper Connect with LensKit Follow
Neat Algorithms - Flocking
Will you Harry Me? the man his code archives email twitter github Neat Algorithms - Flocking February 17th 2011 In this post I’ll explain and demonstrate an algorithm that simulates a group of entities grouping together, illustrating something called “flocking”. I think it’s quite neat because the flock exhibits some complex collective intelligence when just a few simple governing rules are applie
Best algorithms book I ever read
I took a fair amount of time looking at data structures and algorithms while I was studying for my interviews with Google, and based on informed suggestions from Steve Yegge’s infamous post, I decided to buy The Algorithm Design Manual by Steven S. Skiena. If you don’t care to read my ramblings about this book, here’s a summary: Buy this book if you do ANY serious programming. Note: I have no inte
David MacKay: Information Theory, Inference, and Learning Algorithms: The Book
Information Theory, Inference, and Learning Algorithms (Hardback, 640 pages, Published September 2003) Order your copy Price: £35.00 / $60.00 from |CUP UK/USA| |amazon.co.uk/.com/.ca/.co.jp| | Barnes & Noble USA | booksprice. | fetchbook.info | allbookstores | biggerbooks | blackwells | directtextbook | kalahari.net (South Africa) | Special Paperback edition for South Asia.| Download the book too
StringSearch – high-performance pattern matching algorithms in Java
StringSearch High-performance pattern matching algorithms in Java The Java language lacks fast string searching algorithms. StringSearch provides implementations of the Boyer-Moore and the Shift-Or (bit-parallel) algorithms. These algorithms are easily five to ten times faster than the naïve implementation found in java.lang.String. Download Documentation This library contains impleme
Python Patterns - Implementing Graphs
Change notes: 2/22/98, 3/2/98, 12/4/00: This version of this essay fixes several bugs in the code. 6/10/19: Retraction of find_shortest_path as "nearly optimal". 8/11/19: Fix accidental usage of find_graph() instead of find_path() Copyright (c) 1998, 2000, 2003, 2019 Python Software Foundation. All rights reserved. Licensed under the PSF license. Graphs are networks consisting of nodes connected b
Gabor Cselle - Organizing Email
Gabor Cselle, Master's Thesis, ETH Zurich Abstract Email clients were not designed to handle the volume and variety of messages users are dealing with today. While this problem, termed “email overload,” is widely acknowledged, there exist only few products which attempt to solve it. This thesis discusses an email client extension aimed at sensibly structuring the user’s incoming email. We develope
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
When Greedy Algorithms are Perfect: the Matroid
What's a good rate limiting algorithm?
nerdaholyc.com
Sorting
David MacKay: Information Theory, Inference, and Learning Algorithms: Home
Siafoo
Deterministic selection