Keeping two or more copies of the same document synchronized with each other in real-time is a complex challenge. This paper describes the differential synchronization algorithm. Differential synchronization offers scalability, fault-tolerance, and responsive collaborative editing across an unreliable network. 1 Conventional Strategies The three most common approaches to synchronization are ownership, event passing and three-way merges. These methods are conceptually simple, but all have drawbacks. link to googletalk video and mobWrite sw
Solving the nice puzzle below, I found it easier to define a stream coinductively than to define a function from natural numbers inductively. You’re standing in front of a 100 story building with two identical bowling balls. You’ve been tasked with testing the bowling balls’ resilience. The building has a stairwell with a window at each story from which you can (conveniently) drop bowling balls. To test the bowling balls you need to find the first floor at which they break. It might be the 100th floor or it might be the 50th floor, but if it breaks somewhere in the middle you know it will break at every floor above. Devise an algorithm which guarantees you’ll find the first floor at which one of your bowling balls will break. You’re graded on your algorithm’s worst-case running time. “Running time” here means the number of times we drop a ball.
a digital signal processing (DSP) technique for identifying frequency components of a signal, published by Dr. Gerald Goertzel in 1958. While the general Fast Fourier transform (FFT) algorithm computes evenly across the bandwidth of the incoming signal, the Goertzel algorithm looks at specific, predetermined frequency.
a series of learning activities that reveals a little-known secret: computer science isn't really about computers at all. Unplugged teaches principles of computer science through games and puzzles.
By Oleg Krivtsov - Implementing Lucas-Kanade and Baker-Dellaert-Matthews image alignment algorithms (remember to check l8r freaking site changes the urls)
in admob's case (e.g. a profit-maximization problem), the cost matrix prob should be modified so that minimization of the matrix elements results in maximizing the original cost values
a library of simple functions that are optimized for various CPUs. These functions are generally loops implementing simple algorithms, such as converting an array of N integers to floating-point numbers...
a compilation of Michael's writings on assembly language and graphics programming (including Dr. Dobb's Journal "Graphics Programming" column).Focus is on profiling and code testing, as well as performance optimization.
by Bill Green. using the Sobel and the Laplace methods."Edges characterize boundaries and are therefore a problem of fundamental importance in image processing"
a collection of machine learning algorithms for data mining tasks. The algorithms can either be applied directly to a dataset or called from your own Java code.
"I could write a spelling corrector that achieves 80 or 90% accuracy at a rate of at least 10 words per second." and did, a guide on how it works is included also.
E. Alotaibi. Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, Seite 158–160. Richland, SC, International Foundation for Autonomous Agents and Multiagent Systems, (2019)
C. Draude, G. Klumbyte, und P. Treusch. Proceedings of International Workshop on Bias in Information, Algorithms, and Systems co-located with 13th International Conference on Transforming Digital Worlds (iConference 2018), CEUR Workshop Proceedings, (2018)
R. Binns, M. Van Kleek, M. Veale, U. Lyngs, J. Zhao, und N. Shadbolt. (2018)cite arxiv:1801.10408Comment: 14 pages, 3 figures, ACM Conference on Human Factors in Computing Systems (CHI'18), April 21--26, Montreal, Canada.
S. Bera, und A. Chakrabarti. 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, Seite 11:1--11:14. (2017)