Showing posts with label computer science. Show all posts
Showing posts with label computer science. Show all posts
Thursday, April 17, 2014
Sunday, June 28, 2009
Syntactic sugar
Syntactic sugar
"In computer science, syntactic sugar in a language is syntax designed to make things easier to read or to express, while alternative ways of expressing them exist."
"In computer science, syntactic sugar in a language is syntax designed to make things easier to read or to express, while alternative ways of expressing them exist."
Thursday, June 11, 2009
Levenshtein distance
Levenshtein distance
"In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between two sequences (i.e., the so called edit distance)."
"In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between two sequences (i.e., the so called edit distance)."
Monday, June 01, 2009
De Morgan's laws
De Morgan's laws
"In formal logic, De Morgan's laws are rules relating the logical operators 'and' and 'or' in terms of each other via negation, namely:
NOT (P OR Q) = (NOT P) AND (NOT Q)
NOT (P AND Q) = (NOT P) OR (NOT Q)"
"In formal logic, De Morgan's laws are rules relating the logical operators 'and' and 'or' in terms of each other via negation, namely:
NOT (P OR Q) = (NOT P) AND (NOT Q)
NOT (P AND Q) = (NOT P) OR (NOT Q)"
Friday, May 29, 2009
Star schema
Star schema
"The star schema (sometimes referenced as star join schema) is the simplest style of data warehouse schema."
"The star schema (sometimes referenced as star join schema) is the simplest style of data warehouse schema."
Extended Backus–Naur Form
Extended Backus–Naur Form
"In computer science, Extended Backus–Naur Form (EBNF) is a metasyntax notation used to express context-free grammars: that is, a formal way to describe computer programming languages and other formal languages."
"In computer science, Extended Backus–Naur Form (EBNF) is a metasyntax notation used to express context-free grammars: that is, a formal way to describe computer programming languages and other formal languages."