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.
Matthew's C++ Genetic Algorithms Library is set of C++ genetic algorithm objects, it includes tools for using genetic algorithms to do optimization in any C++ program.
Interview with Sebastian DeGuy. We discuss how small the textures can actual get, whether procedural textures can compare with textures in games like Crysis and much more
"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.
This paper presents a framework for modeling and optimizing max algorithms commonly used in crowdsourcing. The model allows tuning the number of human responses needed and the size of item sets to be compared for achieving a certain level of quality given time and budget constraints.
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.
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 tool to optimize the placement of rectangles in a band of semi-infinite size (2D bin packing problem). It can be useful for cutting stocks in trucks and factories.
a new similarity ranking algorithm, together with its associated string similarity metric. I also include Java source code, so you can easily incorporate the algorithm into your own applications.
a free (under GNU Lesser GPL) library which provides a uniform interface to a large number of hash algorithms. These algorithms can be used to compute checksums, message digests, and other signatures.
a fast password cracker, currently available for many flavors. Its primary purpose is to detect weak Unix passwords. Besides several crypt(3) password hash types most commonly found on various Unix flavors, many others supported out of the box
a software framework that allows for advanced sequence and protocol stream analysis by utilizing bioinformatics algorithms. The sole purpose of this software is to identify protocol fields in unknown or poorly documented network protocol formats.
a collaborative effort to develop a robust, commercial-grade, full-featured, and Open Source toolkit implementing the Secure Sockets Layer (SSL v2/v3) and Transport Layer Security (TLS v1) protocols as well as a full-strength general purpose cryptography
a client-side implementation of the rsync algorithm. It allows updating of files from a remote Web server without requiring a full download or a special remote server application.
The numbers that control your life. You're identified by dozens of numbers. Your phone number, your driver's license number, your social security number, your zip code, your license plate, your credit card numbers. I find these numbers fascinating. Who distributes them? What can they be used for? How can you use them? How are they issued?
The Portable Network Graphics (PNG) is a format for storing compressed raster graphics. The compression engine is based on the Deflate method [RFC1951], designed by PKWare and originally used in PKZIP.
a rule engine and scripting environment written entirely in Sun's Java, you can build Java software that has the capacity to "reason" using knowledge you supply in the form of declarative rules. Jess is small, light, and one of the fastest rule engines av
comprehensive, modular and portable cryptographic toolkit that provides developers with a vast array of well known published block ciphers, one-way hash functions, chaining modes, pseudo-random number generators, public key cryptography and a plethora of
Growing interest in data and analytics in education, teaching, and learning raises the priority for increased, high-quality research into the models, methods, technologies, and impact of analytics. Two research communities – Educational Data Mining (EDM) and Learning Analytics and Knowledge (LAK) have developed separately to address this need. This paper argues for increased and formal communication and collaboration between these communities in order to share research, methods, and tools for data mining and analysis in the service of developing both LAK and EDM fields.
Not all learning analytics are the same. Discover how proactive learning analytics help you influence and improve ongoing learning processes by predicting the future and creating recommendations for action. Identify the 4 key elements that will determine the success of your analytics journey.
IDEA is a series of nonverbal algorithm assembly instructions by Sándor P. Fekete, Sebastian Morr, and Sebastian Stiller. They were originally created for Sándor's algorithms and datastructures lecture at TU Braunschweig, but we hope they will be useful in all sorts of context. We publish them here so that they can be used by teachers, students, and curious people alike.
In 1687, Sir Isaac Newton published his seminal article “Philosophiae Naturalis Principia Mathematica” in which he described the motion of celestial bodies (Newton, 1987).
La ministra Yolanda Díaz abre de nuevo la mesa de negociación con sindicatos y patronal tras el acuerdo alcanzado para reconocer a los 'riders' como trabajadores de las plataformas de reparto
El texto reconoce la relación laboral existente entre el repartidor y las compañías, en línea con la sentencia del Tribunal Supremo, y obliga a las empresas a informar a los sindicatos sobre el funcionamiento de los algoritmos de la aplicación
M. A.Y.Abdelaziz. Emerging Trends in Electrical, Electronics & Instrumentation Engineering: An international Journal (EEIEJ), 1 (1):
01-17(February 2014)
F. Abbattista, V. Carofiglio, and M. Koppen. Proceedings of the Genetic and Evolutionary
Computation Conference, 1, page 769. Orlando, Florida, USA, Morgan Kaufmann, (13-17 July 1999)
Z. Abrams, A. Goel, and S. Plotkin. IPSN '04: Proceedings of the third international symposium on Information processing in sensor networks, page 424--432. New York, NY, USA, ACM Press, (2004)
D. Achlioptas, and F. Ricci-Tersenghi. Abstract Book of the XXIII IUPAP International Conference on Statistical Physics, Genova, Italy, (9-13 July 2007)
D. Adjiashvili, A. Baggio, and R. Zenklusen. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, page 2364--2383. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2017)
R. Agrawal, and R. Srikant. Proceedings of the 20th international conference on Very Large Data Bases (VLDB'94), page 478--499. Morgan Kaufmann, (September 1994)
J. Aguilar, J. Riquelme, and M. Toro. Proceedings of the Genetic and Evolutionary
Computation Conference, 1, page 771. Orlando, Florida, USA, Morgan Kaufmann, (13-17 July 1999)
J. Aguilar, and P. Miranda. Proceedings of the Genetic and Evolutionary
Computation Conference, 1, page 3--10. Orlando, Florida, USA, Morgan Kaufmann, (13-17 July 1999)
H. Aguirre, K. Tanaka, and T. Sugimura. Proceedings of the Genetic and Evolutionary
Computation Conference, 1, page 772. Orlando, Florida, USA, Morgan Kaufmann, (13-17 July 1999)
E. Alba, C. Cotta, and J. Troya. Proceedings of the Genetic and Evolutionary
Computation Conference, 1, page 773. Orlando, Florida, USA, Morgan Kaufmann, (13-17 July 1999)
A. Albuquerque, J. Melo, and A. Doria Neto. Evolvable Machines: Theory & Practice, volume 161 of Studies in Fuzziness and Soft Computing, chapter 8, Springer, Berlin, (2004)
A. Almal, A. Mitra, R. Datar, P. Lenehan, D. Fry, R. Cote, and W. Worzel. GECCO 2006: Proceedings of the 8th annual conference
on Genetic and evolutionary computation, 1, page 239--246. Seattle, Washington, USA, ACM Press, (8-12 July 2006)
N. Alon, T. Lee, A. Shraibman, and S. Vempala. Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, page 675--684. (2013)
N. Alon, K. Makarychev, Y. Makarychev, and A. Naor. Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, page 486--493. (2005)
E. Alotaibi. Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, page 158–160. Richland, SC, International Foundation for Autonomous Agents and Multiagent Systems, (2019)
A. Alroomi, F. Albasri, and J. H.Talaq. International Journal on Soft Computing, Artificial Intelligence and Applications (IJSCAI), 2 (6):
20(December 2013)
N. Archak, A. Ghose, and P. Ipeirotis. KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, page 56-65. New York, NY, USA, ACM, (2007)
L. Arge, D. Eppstein, and M. Goodrich. PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, page 69--76. New York, NY, USA, ACM, (2005)
Y. Arimone, B. Bégaud, G. Miremont-Salamé, A. Fourrier-Réglat, M. Molimard, N. Moore, and F. Haramburu. Journal of clinical epidemiology, 59 (3):
308-14(March 2006)4201<m:linebreak></m:linebreak>LR: 20061115; PUBM: Print; JID: 8801383; 0 (Pharmaceutical Preparations); 2004/01/13 received; 2004/10/20 revised; 2005/08/01 accepted; ppublish;<m:linebreak></m:linebreak>Mesures d'associació.
J. Aspnes, K. Chang, and A. Yampolskiy. Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, page 43–52. USA, Society for Industrial and Applied Mathematics, (2005)