Publication Date
| In 2025 | 0 |
| Since 2024 | 0 |
| Since 2021 (last 5 years) | 1 |
| Since 2016 (last 10 years) | 1 |
| Since 2006 (last 20 years) | 1 |
Descriptor
| Algorithms | 7 |
| Tables (Data) | 7 |
| Mathematical Models | 4 |
| Coding | 3 |
| Comparative Analysis | 3 |
| Information Storage | 3 |
| Information Theory | 3 |
| Performance | 3 |
| Evaluation | 2 |
| User Needs (Information) | 2 |
| Artificial Intelligence | 1 |
| More ▼ | |
Author
| Darling, Alexander L. | 1 |
| Feygin, Gennady | 1 |
| Grumbach, Stephane | 1 |
| Howard, Paul G | 1 |
| Liu, Yi | 1 |
| Losee, Robert M., Jr. | 1 |
| Savoy, Jacques | 1 |
| Tahi, Fariza | 1 |
| Vitter, Jeffrey Scott | 1 |
| Xiao, Mengjin | 1 |
| Xu, TianWei | 1 |
| More ▼ | |
Publication Type
| Reports - Evaluative | 7 |
| Journal Articles | 6 |
| Speeches/Meeting Papers | 3 |
Education Level
Audience
| Administrators | 1 |
| Practitioners | 1 |
| Support Staff | 1 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Direct linkLiu, Yi; Xu, TianWei; Xiao, Mengjin – International Journal of Information and Communication Technology Education, 2023
In order to better grasp the needs of library users and provide them with more accurate knowledge services, combining the characteristics of university libraries, this article applies library small data to personalized recommendation and proposes a small data fusion algorithm model for library personalized recommendation. This model combines the…
Descriptors: Research Libraries, Data Collection, Data Analysis, Tables (Data)
Peer reviewedDarling, Alexander L. – College and University, 1987
A method for checking college students' completion of program and graduation requirements by computer is outlined. The procedure operates by having degree programs defined in tables and is simple enough to be achieved by junior program staff without the need for programmers and analysts. (MSE)
Descriptors: Algorithms, College Administration, Computer Software, Degree Requirements
Peer reviewedHoward, Paul G; Vitter, Jeffrey Scott – Information Processing & Management, 1994
Describes a detailed algorithm for fast text compression. Related to the PPM (prediction by partial matching) method, it simplifies the modeling phase by eliminating the escape mechanism and speeds up coding by using a combination of quasi-arithmetic coding and Rice coding. Details of the use of quasi-arithmetic code tables are given, and their…
Descriptors: Algorithms, Coding, Electronic Text, Information Storage
Peer reviewedFeygin, Gennady; And Others – Information Processing & Management, 1994
Presents two new algorithms for performing arithmetic coding without employing multiplication and discusses their implementation requirements. The first algorithm, suitable for an alphabet of arbitrary size, reduces the worst case excess length to under 0.8%. The second algorithm, suitable only for alphabets of less than 12 symbols, allows even…
Descriptors: Algorithms, Coding, Comparative Analysis, Evaluation
Peer reviewedSavoy, Jacques – Information Processing & Management, 1997
Discussion of evaluation methodology in information retrieval focuses on the average precision over a set of fixed recall values in an effort to evaluate the retrieval effectiveness of a search algorithm. Highlights include a review of traditional evaluation methodology with examples; and a statistical inference methodology called bootstrap.…
Descriptors: Algorithms, Evaluation Methods, Information Retrieval, Mathematical Formulas
Peer reviewedGrumbach, Stephane; Tahi, Fariza – Information Processing & Management, 1994
Analyzes the properties of genetic sequences that cause the failure of classical algorithms used for data compression. A lossless algorithm, which compresses the information contained in DNA and RNA sequences by detecting regularities such as palindromes, is presented. This algorithm combines substitutional and statistical methods and appears to…
Descriptors: Algorithms, Coding, Comparative Analysis, Databases
Download full textLosee, Robert M., Jr. – 1993
A model of mono- or multimedia document structure is proposed consistent with the notion that there should be few changes in subject between one document passage and adjacent passages, where a passage may be a phrase, sentence, or paragraph. An algorithm for ordering passages in a composition is provided which is optimal given only a concern for…
Descriptors: Algorithms, Communication (Thought Transfer), Computer Assisted Instruction, Discourse Analysis
