text stringlengths 14 4.79k | source stringlengths 13 304 | tokens float64 75 1.06k ⌀ | char_length float64 106 4.79k ⌀ | article_title stringlengths 16 300 ⌀ |
|---|---|---|---|---|
associative array An associative array, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each possible key appears at most once in the collection. Operations associated with this data type allow: the addition of a pair to the collection the removal of a... | Wikipedia - Glossary of computer science - A | 205 | 1,140 | null |
Section: B. bandwidth The maximum rate of data transfer across a given path. Bandwidth may be characterized as network bandwidth, data bandwidth, or digital bandwidth. Bayesian programming A formalism and a methodology for having a technique to specify probabilistic models and solve problems when less than the necessar... | Wikipedia - Glossary of computer science - B | 326 | 1,721 | null |
big O notation A mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. It is a member of a family of notations invented by Paul Bachmann, Edmund Landau, and others, collectively called Bachmann–Landau notation or asymptotic notation. bin... | Wikipedia - Glossary of computer science - B | 337 | 1,649 | null |
A binary digit can have one of two possible values, and may be physically represented with a two-state device. These state values are most commonly represented as either a 0or1. bit rate (R) Also bitrate. In telecommunications and computing, the number of bits that are conveyed or processed per unit of time. blacklist ... | Wikipedia - Glossary of computer science - B | 346 | 1,689 | null |
The Boolean data type is primarily associated with conditional statements, which allow different actions by changing control flow depending on whether a programmer-specified Boolean condition evaluates to true or false. It is a special case of a more general logical data type (see probabilistic logic)—i.e. logic need n... | Wikipedia - Glossary of computer science - B | 336 | 1,670 | null |
Section: C. callback Any executable code that is passed as an argument to other code that is expected to "call back" (execute) the argument at a given time. This execution may be immediate, as in a synchronous callback, or it might happen at a later time, as in an asynchronous callback. central processing unit (CPU) Th... | Wikipedia - Glossary of computer science - C | 318 | 1,485 | null |
class In object-oriented programming, an extensible program-code-template for creating objects, providing initial values for state (member variables) and implementations of behavior (member functions or methods). In many languages, the class name is used as the name for the class (the template itself), the name for the... | Wikipedia - Glossary of computer science - C | 322 | 1,628 | null |
Operationally, a closure is a record storing a function together with an environment. cloud computing Shared pools of configurable computer system resources and higher-level services that can be rapidly provisioned with minimal management effort, often over the Internet. Cloud computing relies on sharing of resources t... | Wikipedia - Glossary of computer science - C | 346 | 1,966 | null |
Codes are studied by various scientific disciplines—such as information theory, electrical engineering, mathematics, linguistics, and computer science—for the purpose of designing efficient and reliable data transmission methods. This typically involves the removal of redundancy and the correction or detection of error... | Wikipedia - Glossary of computer science - C | 332 | 1,809 | null |
Each line of the file is a data record. Each record consists of one or more fields, separated by commas. The use of the comma as a field separator is the source of the name for this file format. compiler A computer program that transforms computer code written in one programming language (the source language) into anot... | Wikipedia - Glossary of computer science - C | 339 | 1,783 | null |
The field is broadly defined and includes foundations in biology, applied mathematics, statistics, biochemistry, chemistry, biophysics, molecular biology, genetics, genomics, computer science, and evolution. Computational biology is different from biological computing, which is a subfield of computer science and comput... | Wikipedia - Glossary of computer science - C | 343 | 2,188 | null |
It is an area of science which spans many disciplines, but at its core it involves the development of computer models and simulations to understand complex natural systems. computational steering Is the practice of manually intervening with an otherwise autonomous computational process, to change its outcome. computer ... | Wikipedia - Glossary of computer science - C | 336 | 2,056 | null |
These data links are established over cable media such as wires or optic cables, or wireless media such as Wi-Fi. computer program Is a collection of instructions that can be executed by a computer to perform a specific task. computer programming The process of designing and building an executable computer program for ... | Wikipedia - Glossary of computer science - C | 348 | 2,000 | null |
From the perspective of engineering, it seeks to automate tasks that the human visual system can do. computing Is any goal-oriented activity requiring, benefiting from, or creating computing machinery. It includes study of algorithmic processes and development of both hardware and software. It has scientific, engineeri... | Wikipedia - Glossary of computer science - C | 332 | 1,791 | null |
Apart from the case of branch predication, this is always achieved by selectively altering the control flow based on some condition. container Is a class, a data structure, or an abstract data type (ADT) whose instances are collections of other objects. In other words, they store objects in an organized way that follow... | Wikipedia - Glossary of computer science - C | 347 | 1,876 | null |
Creative Commons (CC) An American non-profit organization devoted to expanding the range of creative works available for others to build upon legally and to share. The organization has released several copyright-licenses, known as Creative Commons licenses, free of charge to the public. cryptography Or cryptology, is t... | Wikipedia - Glossary of computer science - C | 224 | 1,253 | null |
Section: D. daemon In multitasking computer operating systems, a daemon ( or ) is a computer program that runs as a background process, rather than being under the direct control of an interactive user. Traditionally, the process names of a daemon end with the letter d, for clarification that the process is in fact a d... | Wikipedia - Glossary of computer science - D | 344 | 1,906 | null |
Aside from the raw analysis step, it also involves database and data management aspects, data pre-processing, model and inference considerations, interestingness metrics, complexity considerations, post-processing of discovered structures, visualization, and online updating. data science An interdisciplinary field that... | Wikipedia - Glossary of computer science - D | 333 | 1,784 | null |
debugging The process of finding and resolving defects or problems within a computer program that prevent correct operation of computer software or the system as a whole. Debugging tactics can involve interactive debugging, control flow analysis, unit testing, integration testing, log file analysis, monitoring at the a... | Wikipedia - Glossary of computer science - D | 336 | 1,746 | null |
digital signal processing (DSP) The use of digital processing, such as by computers or more specialized digital signal processors, to perform a wide variety of signal processing operations. The signals processed in this manner are a sequence of numbers that represent samples of a continuous variable in a domain such as... | Wikipedia - Glossary of computer science - D | 341 | 1,822 | null |
Examples of distributed systems vary from SOA-based systems to massively multiplayer online games to peer-to-peer applications. divide and conquer algorithm An algorithm design paradigm based on multi-branched recursion. A divide-and-conquer algorithm works by recursively breaking down a problem into two or more sub-pr... | Wikipedia - Glossary of computer science - D | 324 | 1,761 | null |
Section: E. edge device A device which provides an entry point into enterprise or service provider core networks. Examples include routers, routing switches, integrated access devices (IADs), multiplexers, and a variety of metropolitan area network (MAN) and wide area network (WAN) access devices. Edge devices also pro... | Wikipedia - Glossary of computer science - E | 341 | 1,842 | null |
Modern encryption schemes utilize the concepts of public-key and symmetric-key. Modern encryption techniques ensure security because modern computers are inefficient at cracking the encryption. event An action or occurrence recognized by software, often originating asynchronously from the external environment, that may... | Wikipedia - Glossary of computer science - E | 331 | 1,685 | null |
Causes a computer "to perform indicated tasks according to encoded instructions," as opposed to a data file that must be parsed by a program to be meaningful. The exact interpretation depends upon the use - while "instructions" is traditionally taken to mean machine code instructions for a physical CPU, in some context... | Wikipedia - Glossary of computer science - E | 317 | 1,775 | null |
Section: F. fault-tolerant computer system A system designed around the concept of fault tolerance. In essence, they must be able to continue working to a level of satisfaction in the presence of errors or breakdowns. feasibility study An investigation which aims to objectively and rationally uncover the strengths and ... | Wikipedia - Glossary of computer science - F | 309 | 1,654 | null |
For this reason, floating-point computation is often found in systems which include very small and very large real numbers, which require fast processing times. A number is, in general, represented approximately to a fixed number of significant digits (the significand) and scaled using an exponent in some fixed base; t... | Wikipedia - Glossary of computer science - F | 330 | 1,204 | null |
There are also other possibilities, e.g. COBOL uses "PERFORM VARYING". formal methods A set of mathematically based techniques for the specification, development, and verification of software and hardware systems. The use of formal methods for software and hardware design is motivated by the expectation that, as in oth... | Wikipedia - Glossary of computer science - F | 174 | 1,014 | null |
Section: G. game theory The study of mathematical models of strategic interaction between rational decision-makers. It has applications in all fields of social science, as well as in logic and computer science. Originally, it addressed zero-sum games, in which each participant's gains or losses are exactly balanced by ... | Wikipedia - Glossary of computer science - G | 339 | 1,729 | null |
Section: H. handle In computer programming, a handle is an abstract reference to a resource that is used when application software references blocks of memory or objects that are managed by another system like a database or an operating system. hard problem Computational complexity theory focuses on classifying computa... | Wikipedia - Glossary of computer science - H | 344 | 1,680 | null |
The node at the "top" of the heap (with no parents) is called the root node. heapsort A comparison-based sorting algorithm. Heapsort can be thought of as an improved selection sort: like that algorithm, it divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracti... | Wikipedia - Glossary of computer science - H | 204 | 1,002 | null |
Section: I. identifier In computer languages, identifiers are tokens (also called symbols) which name language entities. Some of the kinds of entities an identifier might denote include variables, types, labels, subroutines, and packages. IDE Integrated development environment. image processing imperative programming A... | Wikipedia - Glossary of computer science - I | 333 | 1,770 | null |
The communication between an information processing system, such as a computer, and the outside world, possibly a human or another information processing system. Inputs are the signals or data received by the system and outputs are the signals or data sent from it. The term can also be used as part of an action; to "pe... | Wikipedia - Glossary of computer science - I | 342 | 1,782 | null |
integration testing (sometimes called integration and testing, abbreviated I&T) is the phase in software testing in which individual software modules are combined and tested as a group. Integration testing is conducted to evaluate the compliance of a system or component with specified functional requirements. It occurs... | Wikipedia - Glossary of computer science - I | 347 | 1,854 | null |
Some computer hardware devices, such as a touchscreen, can both send and receive data through the interface, while others such as a mouse or microphone may only provide an interface to send data to a given system. internal documentation Computer software is said to have Internal Documentation if the notes on how and wh... | Wikipedia - Glossary of computer science - I | 340 | 1,834 | null |
Section: L. library (computing) A collection of non-volatile resources used by computer programs, often for software development. These may include configuration data, documentation, help data, message templates, pre-written code and subroutines, classes, values, or type specifications. linear search Also sequential se... | Wikipedia - Glossary of computer science - L | 350 | 1,776 | null |
It is one of the essential stages in the process of starting a program, as it places programs into memory and prepares them for execution. Loading a program involves reading the contents of the executable file containing the program instructions into memory, and then carrying out other required preparatory tasks to pre... | Wikipedia - Glossary of computer science - L | 201 | 1,068 | null |
Section: M. machine learning (ML) The scientific study of algorithms and statistical models that computer systems use to perform a specific task without using explicit instructions, relying on patterns and inference instead. It is seen as a subset of artificial intelligence. Machine learning algorithms build a mathemat... | Wikipedia - Glossary of computer science - M | 335 | 1,932 | null |
memory Computer data storage, often called storage, is a technology consisting of computer components and recording media that are used to retain digital data. It is a core function and fundamental component of computers.: 15–16 merge sort Also mergesort. An efficient, general-purpose, comparison-based sorting algorith... | Wikipedia - Glossary of computer science - M | 340 | 1,770 | null |
Section: N. natural language processing (NLP) A subfield of linguistics, computer science, information engineering, and artificial intelligence concerned with the interactions between computers and human (natural) languages, in particular how to program computers to process and analyze large amounts of natural language... | Wikipedia - Glossary of computer science - N | 209 | 1,249 | null |
Section: O. object An object can be a variable, a data structure, a function, or a method, and as such, is a value in memory referenced by an identifier. In the class-based object-oriented programming paradigm, object refers to a particular instance of a class, where the object can be a combination of variables, functi... | Wikipedia - Glossary of computer science - O | 350 | 1,685 | null |
A feature of objects is an object's procedures that can access and often modify the data fields of the object with which they are associated (objects have a notion of "this" or "self"). In OOP, computer programs are designed by making them out of objects that interact with one another. OOP languages are diverse, but th... | Wikipedia - Glossary of computer science - O | 299 | 1,555 | null |
Section: P. pair programming An agile software development technique in which two programmers work together at one workstation. One, the driver, writes code while the other, the observer or navigator, reviews each line of code as it is typed in. The two programmers switch roles frequently. parallel computing A type of ... | Wikipedia - Glossary of computer science - P | 342 | 1,774 | null |
This can be that of another value located in computer memory, or in some cases, that of memory-mapped computer hardware. A pointer references a location in memory, and obtaining the value stored at that location is known as dereferencing the pointer. As an analogy, a page number in a book's index could be considered a ... | Wikipedia - Glossary of computer science - P | 327 | 1,657 | null |
Any data actively operated on is also stored there in uniform manner. primitive data type priority queue An abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served befo... | Wikipedia - Glossary of computer science - P | 330 | 1,829 | null |
programming language implementation Is a system for executing computer programs. There are two general approaches to programming language implementation: interpretation and compilation. programming language theory (PLT) is a branch of computer science that deals with the design, implementation, analysis, characterizati... | Wikipedia - Glossary of computer science - P | 275 | 1,593 | null |
Section: R. R programming language R is a programming language and free software environment for statistical computing and graphics supported by the R Foundation for Statistical Computing. The R language is widely used among statisticians and data miners for developing statistical software and data analysis. radix Also... | Wikipedia - Glossary of computer science - R | 312 | 1,518 | null |
While this apparently defines an infinite number of instances (function values), it is often done in such a way that no infinite loop or infinite chain of references can occur. reference Is a value that enables a program to indirectly access a particular datum, such as a variable's value or a record, in the computer's ... | Wikipedia - Glossary of computer science - R | 335 | 1,728 | null |
Many relational database systems have an option of using the SQL (Structured Query Language) for querying and maintaining the database. reliability engineering A sub-discipline of systems engineering that emphasizes dependability in the lifecycle management of a product. Reliability describes the ability of a system or... | Wikipedia - Glossary of computer science - R | 348 | 2,044 | null |
When using approximation equations or algorithms, especially when using finitely many digits to represent real numbers (which in theory have infinitely many digits), one of the goals of numerical analysis is to estimate computation errors. Computation errors, also called numerical errors, include both truncation errors... | Wikipedia - Glossary of computer science - R | 350 | 1,772 | null |
Section: S. search algorithm Any algorithm which solves the search problem, namely, to retrieve information stored within some data structure, or calculated in the search space of a problem domain, either with discrete or continuous values. secondary storage Also known as external memory or auxiliary storage, differs f... | Wikipedia - Glossary of computer science - S | 329 | 1,849 | null |
This can be shown by describing the relationship between the input and output of a program, or an explanation of how the program will be executed on a certain platform, hence creating a model of computation. sequence In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and ... | Wikipedia - Glossary of computer science - S | 334 | 1,476 | null |
Also, the sequence (1, 1, 2, 3, 5, 8), which contains the number 1 at two different positions, is a valid sequence. Sequences can be finite, as in these examples, or infinite, such as the sequence of all even positive integers (2, 4, 6, ...). In computing and computer science, finite sequences are sometimes called stri... | Wikipedia - Glossary of computer science - S | 314 | 1,575 | null |
Strong strict two-phase locking (SS2PL) is a popular serializability mechanism utilized in most of the database systems (in various variants) since their early days in the 1970s. serialization Is the process of translating data structures or object state into a format that can be stored (for example, in a file or memor... | Wikipedia - Glossary of computer science - S | 321 | 1,626 | null |
The most common component of an SLA is that the services should be provided to the customer as agreed upon in the contract. As an example, Internet service providers and telcos will commonly include service level agreements within the terms of their contracts with customers to define the level(s) of service being sold ... | Wikipedia - Glossary of computer science - S | 347 | 1,826 | null |
In computer science and software engineering, computer software is all information processed by computer systems, programs and data. Computer software includes computer programs, libraries and related non-executable data, such as online documentation or digital media. Computer hardware and software require each other a... | Wikipedia - Glossary of computer science - S | 341 | 1,788 | null |
software design Is the process by which an agent creates a specification of a software artifact, intended to accomplish goals, using a set of primitive components and subject to constraints. Software design may refer to either "all the activity involved in conceptualizing, framing, implementing, commissioning, and ulti... | Wikipedia - Glossary of computer science - S | 350 | 2,026 | null |
software engineering Is the systematic application of engineering approaches to the development of software. Software engineering is a computing discipline. software maintenance In software engineering is the modification of a software product after delivery to correct faults, to improve performance or other attributes... | Wikipedia - Glossary of computer science - S | 333 | 1,931 | null |
Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output. More formally, the output of any sorting algorithm must sati... | Wikipedia - Glossary of computer science - S | 328 | 1,684 | null |
Based on the unique risk patterns of a given project, the spiral model guides a team to adopt elements of one or more process models, such as incremental, waterfall, or evolutionary prototyping. stack Is an abstract data type that serves as a collection of elements, with two main principal operations: push, which adds ... | Wikipedia - Glossary of computer science - S | 337 | 1,707 | null |
It is a core function and fundamental component of computers.: 15–16 stream Is a sequence of data elements made available over time. A stream can be thought of as items on a conveyor belt being processed one at a time rather than in large batches. string In computer programming, a string is traditionally a sequence of ... | Wikipedia - Glossary of computer science - S | 346 | 1,693 | null |
This unit can then be used in programs wherever that particular task should be performed. Subroutines may be defined within programs, or separately in libraries that can be used by many programs. In different programming languages, a subroutine may be called a routine, subprogram, function, method, or procedure. Techni... | Wikipedia - Glossary of computer science - S | 333 | 1,920 | null |
There is some disagreement as to just what errors are "syntax errors". For example, some would say that the use of an uninitialized variable's value in Java code is a syntax error, but many others would disagree and would classify this as a (static) semantic error. system console The system console, computer console, r... | Wikipedia - Glossary of computer science - S | 214 | 1,040 | null |
Section: T. technical documentation In engineering, any type of documentation that describes handling, functionality, and architecture of a technical product or a product under development or use. The intended recipient for product technical documentation is both the (proficient) end user as well as the administrator/s... | Wikipedia - Glossary of computer science - T | 302 | 1,544 | null |
Section: U. upload In computer networks, to send data to a remote system such as a server or another client so that the remote system can store a copy. Contrast download. Uniform Resource Locator (URL) Colloquially web address. A reference to a web resource that specifies its location on a computer network and a mechan... | Wikipedia - Glossary of computer science - U | 347 | 1,791 | null |
Section: V. variable In computer programming, a variable, or scalar, is a storage location (identified by a memory address) paired with an associated symbolic name (an identifier), which contains some known or unknown quantity of information referred to as a value. The variable name is the usual way to reference the st... | Wikipedia - Glossary of computer science - V | 298 | 1,535 | null |
Section: W. waterfall model A breakdown of project activities into linear sequential phases, where each phase depends on the deliverables of the previous one and corresponds to a specialisation of tasks. The approach is typical for certain areas of engineering design. In software development, it tends to be among the l... | Wikipedia - Glossary of computer science - W | 340 | 1,676 | null |
Section: Definition. Many devices or programs need data to be presented in a specific format to process the data. For example, Apple Inc devices generally require applications to be downloaded from their App Store. This is a non data-agnostic method, as it uses a specified file type, downloaded from a specific location... | Wikipedia - Agnostic (data) - Definition | 156 | 789 | null |
Section: Implementation. Data agnostic devices and programs work to solve these problems in a variety of ways. Devices can treat files in the same way whether they are downloaded over the internet or transferred over a USB or other cable. Devices and programs can become more data-agnostic by using a generic storage for... | Wikipedia - Agnostic (data) - Implementation | 342 | 1,718 | null |
If one program contains fields and information that another does not, those fields can be saved to the record and pulled for that program, but ignored by other programs. As the entity synchronization layer is data agnostic, additional fields can be added without worrying about recoding the whole database, and concepts ... | Wikipedia - Agnostic (data) - Implementation | 268 | 1,392 | null |
Section: Benefits. Keeping your devices and programs as data agnostic as possible has some clear advantages. Since the data is stored in an agnostic format, developers do not need to hard-code ways to deal with all different kinds of data. A table with information about dogs and one with information about cats can be t... | Wikipedia - Agnostic (data) - Benefits | 336 | 1,664 | null |
Section: Risks. There are, however, a few problems introduced when attempting to make a device or program data agnostic. Since only one piece of code is being used for CRUD operations (regardless of the type of concept), there is a single point of failure. If that code breaks down, the whole system is broken. This risk... | Wikipedia - Agnostic (data) - Risks | 218 | 1,018 | null |
Article: Boolean. Any kind of logic, function, expression, or theory based on the work of George Boole is considered Boolean. Related to this, "Boolean" may refer to: Boolean data type, a form of data with only two possible values (usually "true" and "false") Boolean algebra, a logical calculus of truth values or set m... | Wikipedia - Boolean - Summary | 269 | 1,326 | null |
Article: Catalytic computing. Catalytic computing is a technique in computer science, relevant to complexity theory, that uses full memory, as well as empty memory space, to perform computations. Full memory is memory that begins in an arbitrary state and must be returned to that state at the end of the computation, fo... | Wikipedia - Catalytic computing - Summary | 246 | 1,077 | null |
Section: Results. In 2020 J. Cook and Mertz used catalytic computing to prove to attack the tree evaluation problem (TreeEval) a type of pebble game introduced by Cook, McKenzie, Wehr, Braverman and Santhanam as an example where any algorithm for solving the problem would require too much memory to belong in the L comp... | Wikipedia - Catalytic computing - Results | 264 | 1,046 | null |
Section: Historical background. Going back in history, computers in sports were used for the first time in the 1960s, when the main purpose was to accumulate sports information. Databases were created and expanded in order to launch documentation and dissemination of publications like articles or books that contain any... | Wikipedia - Computer science in sport - Historical background | 327 | 1,848 | null |
Section: Research communities > Historical survey. As a first example, in Australia and New Zealand scientists have built up the MathSport group of ANZIAM (Australia and New Zealand Industrial and Applied Mathematics), which since 1992 organizes biennial meetings, initially under the name "Mathematics and Computers in ... | Wikipedia - Computer science in sport - Research communities > Historical survey | 341 | 1,825 | null |
The internationalization is confirmed moreover by the fact that three conferences already took place outside of Europe - in Calgary (Canada) in 2007, Canberra (Australia) in 2009 and Shanghai (China) in 2011. During the symposium in Calgary additionally, the president position changed - it has been assigned to Prof. Ar... | Wikipedia - Computer science in sport - Research communities > Historical survey | 194 | 877 | null |
Section: Research communities > National organizations. In addition to the international associations from above, currently the following national associations on computer science in sport exist (if available, the web addresses are also given): Austrian Association of Computer Science in Sport - http://www.sportinforma... | Wikipedia - Computer science in sport - Research communities > National organizations | 188 | 927 | null |
Article: Filter and refine. Filter and Refine Principle (FRP) is a general computational strategy in computer science. FRP is used broadly across various disciplines, particularly in information retrieval, database management, and pattern recognition, which efficiently processes large sets of objects through a two-stag... | Wikipedia - Filter and refine - Summary | 254 | 1,425 | null |
Section: Overview. FRP follows a two-step processing strategy: Filter: an efficient filter function f f i l t e r {\displaystyle f_{filter}} is applied to each object x {\displaystyle x} in the dataset D {\displaystyle {\mathcal {D}}} . The filtered subset D ′ {\displaystyle {\mathcal {D}}'} is defined as D ′ = { x | f... | Wikipedia - Filter and refine - Overview | 234 | 639 | null |
The filtered subset D ′ {\displaystyle {\mathcal {D}}'} is defined as D ′ = { x | f f i l t e r ( x ) ≥ v } {\displaystyle {\mathcal {D}}'=\{x|f_{filter}(x)\geq v\}} for value-based tasks, where v {\displaystyle v} is a threshold value, or D ′ = { x | f f i l t e r ( x ) = v } {\displaystyle {\mathcal {D}}'=\{x|f_{filt... | Wikipedia - Filter and refine - Overview | 338 | 814 | null |
Refine: a more complex refinement function f r e f i n e {\displaystyle f_{refine}} is applied to each object x {\displaystyle x} in D ′ {\displaystyle {\mathcal {D}}'} , resulting in the set R = { x | f r e f i n e ( x ) ≥ v } {\displaystyle {\mathcal {R}}=\{x|f_{refine(x)}\geq v\}} , or likewise, R = { x | f r e f i ... | Wikipedia - Filter and refine - Overview | 204 | 585 | null |
Section: Applications in Specific Fields > Reinforcement Learning. In the domain of artificial intelligence, Reinforcement Learning (RL) demonstrates the Filter and Refine Principle (FRP) through the processes of policy and value function estimation. In RL, agents learn to make decisions by exploring the environment an... | Wikipedia - Filter and refine - Applications in Specific Fields > Reinforcement Learning | 228 | 1,247 | null |
Section: Applications in Specific Fields > Mixture of Experts. The mixture of experts (MoE) is a machine learning paradigm that incorporates FRP by dividing a complex problem into simpler, manageable sub-tasks, each handled by a specialized expert. In the filtering stage, a gating mechanism—acting as a filter that dete... | Wikipedia - Filter and refine - Applications in Specific Fields > Mixture of Experts | 217 | 1,183 | null |
Section: Applications in Specific Fields > Cascading Classifiers. Cascading classifiers in computer vision exemplify the Filter and Refine Principle (FRP) by employing a hierarchical arrangement of classifiers, each increasing in complexity and precision. Initial classifiers quickly filter out clearly irrelevant data, ... | Wikipedia - Filter and refine - Applications in Specific Fields > Cascading Classifiers | 196 | 1,105 | null |
Section: Applications in Specific Fields > Query Processing. Query processing in large databases and information retrieval systems frequently employ the FRP to handle vast amounts of data efficiently. Initially, a query processor filters data through mechanisms like query optimization, where queries are reformulated an... | Wikipedia - Filter and refine - Applications in Specific Fields > Query Processing | 259 | 1,500 | null |
Section: History and Development. The principles underlying FRP can be traced back to early efforts in optimizing database systems. The principle is the main optimization strategy of indices, where indices serve as a means to retrieve a subset of data quickly without scanning a large portion of the database, and do a t... | Wikipedia - Filter and refine - History and Development | 336 | 1,792 | null |
Section: Subfields > Artificial intelligence. Outline of artificial intelligence Artificial intelligence – The implementation and study of systems that exhibit an autonomous intelligence or behavior of their own. Automated reasoning – Solving engines, such as used in Prolog, which produce steps to a result given a quer... | Wikipedia - Outline of computer science - Subfields > Artificial intelligence | 188 | 1,114 | null |
Section: Subfields > Scientific computing. Computational science – constructing mathematical models and quantitative analysis techniques and using computers to analyze and solve scientific problems. Numerical analysis – Approximate numerical solution of mathematical problems such as root-finding, integration, the solut... | Wikipedia - Outline of computer science - Subfields > Scientific computing | 163 | 1,086 | null |
Section: Hardware. Processors (CPU's) often include prefetching that attempts to reduce cache misses by loading data into cache before it is requested by the running program. This is for programs that access memory in predictable patterns, such as loops that iterate over arrays. Hardware prefetching is can be done with... | Wikipedia - Prefetching - Hardware | 164 | 822 | null |
Article: Transition (computer science). Transition refers to a computer science paradigm in the context of communication systems which describes the change of communication mechanisms, i.e., functions of a communication system, in particular, service and protocol components. In a transition, communication mechanisms wi... | Wikipedia - Transition (computer science) - Summary | 329 | 1,814 | null |
For example, in case of video streaming/transmission, the use of different video data encoding can be carried out depending on the available data transmission rate. These changes are controlled and implemented by transitions; A research example is a context-aware video adaptation service to support mobile video applica... | Wikipedia - Transition (computer science) - Summary | 198 | 1,116 | null |
Section: Recent research. The study of new and fundamental design methods, models and techniques that enable automated, coordinated and cross-layer transitions between functionally similar mechanisms within a communication system is the main goal of a collaborative research center funded by the German research foundati... | Wikipedia - Transition (computer science) - Recent research | 278 | 1,608 | null |
Article: Sherifah Tumusiime. Sherifah Tumusiime (Born July 13, 1988), alias "Chief Hustler" is a Ugandan Computer scientist, businesswoman, entrepreneur, and technology advocate. She is the founder and Chief Executive Officer of Zimba Group Ltd flagship project, Zimba Women, a technology social enterprise supports and ... | Wikipedia - Sherifah Tumusiime - Summary | 156 | 732 | null |
Article: Atomic (magazine). Atomic (or Atomic MPC) was a monthly Australian magazine and online community that focused on computing and technology, with a great emphasis on gaming, modding and computer hardware. Atomic was marketed at technology enthusiasts and covered topics that were not normally found in mainstream ... | Wikipedia - Atomic (magazine) - Summary | 207 | 1,090 | null |
Section: History. With a small team of writers led by magazine founder and ex-editor Ben Mansill, who is also the founder of the magazine's only competitor, PC PowerPlay, the first issue of Atomic was published in February 2001. This team consisted of John Gillooly, Bennett Ring, Tim Dean and Daniel Rutter. Gillooly an... | Wikipedia - Atomic (magazine) - History | 276 | 1,333 | null |
Section: The Atomic site and forums. Atomic's online forums were launched on the same day as the magazine. They had various PC gaming and technology sections, as well as a general chat area known as the "Green Room". As of January 2006, approximately 3,600,000 posts had been made across the forums' twenty-one sections.... | Wikipedia - Atomic (magazine) - The Atomic site and forums | 183 | 861 | null |
Section: Events. At the end of 2005 Atomic hosted "Atomic Live", a PC gaming and technology expo in Sydney, Australia. The event culminated in the evening with a presentation of industry awards and a celebration of the magazine's 5th birthday. Although a subsequent Atomic Live was announced in early 2006, it was postpo... | Wikipedia - Atomic (magazine) - Events | 169 | 925 | null |
Article: Australian Apple Review. Australian Apple Review was an Australian computer magazine (ISSN 0816-7184) published by Gareth Powell Pty Ltd and Saturday Magazine Pty Ltd and initially printed by Offset Alpine and then by Ian Liddel Pty Ltd. The first issue was available in newsagents and dealerships in 1984 (36 p... | Wikipedia - Australian Apple Review - Summary | 196 | 979 | null |
Section: History. Macworld was founded by David Bunnell and Cheryl Woodard (publishers) and Andrew Fluegelman (editor). It began as a print magazine in 1984, with its first issue distributed at the launch of the Macintosh computer. As a print magazine, it had the largest audited circulation (both total and newsstand) o... | Wikipedia - Macworld - History | 306 | 1,399 | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.