Conjecture

  •        0

Conjecture is a modular, extensible, open-source C++ framework for Optical Character Recognition (OCR). It is not a single OCR, but rather an extensible collection of OCRs that can be explored, compared, extended and modified within a unified environment

http://conjecture.sourceforge.net

Tags
Implementation
License
Platform

   

comments powered by Disqus


Related Projects

Maj-collatz-ass1 - Implementing a calculation of cycles to complete the collatz conjecture


I will be abiding by the rules of the conjecture, where given a range of numbers I will find the number of cycles it takes to complete the Collatz conjecture, and list the largest of cycles that was required for any respective number within the given range. I will implement this in both Java and C++.

Cs373-11am-collatz-sungjin - Collatz conjecture(3n + 1 conjecture)


CS373 Spring 2011 Project1 Collatz conjecture. Definition of Collatz problem: Take any natural number n. If n is even, divide it by 2 to get n / 2, if n is odd multiply it by 3 and add 1 to obtain 3n + 1. Repeat the process (which has been called "Half Or Triple Plus One", or HOTPO) indefinitely. The conjecture is that no matter what number you start with, you will always eventually reach 1. The property has also been called oneness. (From: http://en.wikipedia.org/wiki/Collatz_conjecture) Google

Dyniqx - Dyniqx provides a unified search interface on top of a number of search engines, and provid


Currently many niche search engines have adopted what we call a linear/top-down/hierarchical approach. We think the rigidity of this linear/top-down/hierarchical approach may limit the user to search within the classification of the resources. Additionally, there are many forms of metadata which have not been fully exploited during the search process. To overcome the rigidity of linear/top-down/hierarchical search, we propose to experiment with the dynamic query approach used to great effect by

Xiangyu-cs373-collatz - write a program to solve the 3n+1 problem


Background: Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs. The Problem: Consider the following algorithm: 1. input n 2. print n 3. if n = 1 then STOP 4. if n is odd then n = 3n + 1 5. else n = n / 2 6. GOTO 2 Given the input 22, the following sequence of numbers will be printed 22 11 34 17 52

Cs373-collatz-jgr397 - Collatz 3n+1


Background: Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs. The Problem: Consider the following algorithm: \t\t input n 2. \t\t print n 3. \t\t if n = 1 then STOP 4. \t\t \t\t if n is odd then 5. \t\t \t\t else 6. \t\t GOTO 2 Given the input 22, the following sequence of numbers will be printed

Kepler-code - Electronic recources supporting the proofs of the Kepler and Dodecahedral conjectures


KeplerCode This project provides independent verification of the computational aspects of two related proofs: Thomas Hales' proof of the Kepler conjecture Thomas Hales and Sean McLaughlin's proof of the Dodecahedral conjecture. The two projects share most of their source code, so it is natural to have one repository for both. The repository also also houses the technical details of the latter proof that could not be included in the published version because of space constraints. The technical de

Fourmi - Mini projet java sur la Fourmi de Langton


On nomme fourmi de Langton un automate cellulaire (voir : machine de Turing) bidimensionel comportant un jeu de règles très simples. Elle fut inventée par Chris Langton dont on lui a donné le nom. Elle constitue l'un des systèmes les plus simples permettant de mettre en évidence un exemple de comportement émergent. RèglesLa fourmi de Langton est un animal hypothétique se déplaçant sur les cases d'un échiquier, selon la règle suivante: Les cases d'une grille peuvent être blanches ou

Cs371pj2 - CS 371p Project - Adam McElwee and Amaan Penang


Project page for CS371p Object Oriented Class. Adam McElwee and Amaan Penang

Clj-primetest - Command line Java tool for finding primes - implements 5 different primality tests


Test for Prime Numbers Summary This project encompasses 5 different tests for primality. The methods implemented are Miller-Rabin, Miller-Rabin Deterministic, Solovay-Strassen, Fermat’s Primality Test and a Brute Force method. In addition to the 5 primality tests, the program is also capable of finding the closest integer to a given upper bound. The largest number it is capable of handling is a 2147483647 bit integer. Primality Tests Miller-Rabin This primality test is a probabilistic primalit

Cs378-su2010-collatz - Collatz (UVa 3n + 1 problem)


This program finds the maximum cycle length in the range of a pair of numbers using the 3n + 1 algorithm (also known as the Collatz conjecture). The idea of the 3n + 1 algorithm is this: if a given natural number is n, divide it by 2; if n is odd, do 3n + 1. Then repeat this operation until 1 is reached. Each operation counts as a cycle, and the total number of cycles needed to reach 1 is thus the cycle length.







Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.

Tag Cloud >>