Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

Paris Kanellakis Award

Index Paris Kanellakis Award

The Paris Kanellakis Theory and Practice Award is granted yearly by the Association for Computing Machinery (ACM) to honor "specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing". [1]

105 relations: Abraham Lempel, ACM SIGACT, AdaBoost, Adi Shamir, American Airlines Flight 965, Amos Fiat, Andrei Broder, Association for Computing Machinery, Bioinformatics, Boosting (machine learning), Broadcast encryption, Brown University, Bruno Buchberger, Cell (biology), Charles E. Leiserson, Circuit design, Computer algebra system, Computer scientist, Computer vision, Computer-aided design, Corinna Cortes, Cryptography, Daniel Sleator, Data compression, Data compression ratio, Data structure, DNA, E. Allen Emerson, Edmund M. Clarke, Electronic design automation, Electronics, Email filtering, Erasure code, Eugene Myers, Formal verification, Gary Miller (computer scientist), Gene, Geographic information system, Gerard J. Holzmann, Gröbner basis, Hanan Samet, Information retrieval, Interior-point method, Internet security, Intrusion detection system, James Demmel, Kurt Mehlhorn, Leonard Adleman, Library of Efficient Data types and Algorithms, Linear programming, ..., Locality-sensitive hashing, Logic synthesis, LZ77 and LZ78, Machine learning, Market segmentation, Martin Hellman, Medical diagnosis, Michael Luby, Michael O. Rabin, Mihir Bellare, Miller–Rabin primality test, Model checking, Moni Naor, Moses Charikar, Moshe Vardi, Narendra Karmarkar, Optical character recognition, Paris Kanellakis, Peter Franaszek, Phillip Rogaway, Pierre Wolper, Piotr Indyk, Primality test, Provable security, Public-key cryptography, Quadtree, Ralph Merkle, Randal Bryant, Regression analysis, Robert M. Solovay, Robert Schapire, Robert Tarjan, Ron Rivest, SIGMOD, Signal processing, SIGPLAN, Simulation, Solovay–Strassen primality test, Special Interest Group on Design Automation, Splay tree, Statistical classification, Supervised learning, Support vector machine, Telecommunication, Time complexity, Traitor tracing, Vladimir Vapnik, Volker Strassen, Weather forecasting, Whitfield Diffie, Whole genome sequencing, Work stealing, Yaakov Ziv, Yoav Freund, 8b/10b encoding. Expand index (55 more) »

Abraham Lempel

Abraham Lempel (אברהם למפל, born 10 February 1936) is an Israeli computer scientist and one of the fathers of the LZ family of lossless data compression algorithms.

New!!: Paris Kanellakis Award and Abraham Lempel · See more »

ACM SIGACT

ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science.

New!!: Paris Kanellakis Award and ACM SIGACT · See more »

AdaBoost

AdaBoost, short for Adaptive Boosting, is a machine learning meta-algorithm formulated by Yoav Freund and Robert Schapire, who won the 2003 Gödel Prize for their work.

New!!: Paris Kanellakis Award and AdaBoost · See more »

Adi Shamir

Adi Shamir (עדי שמיר; born July 6, 1952) is an Israeli cryptographer.

New!!: Paris Kanellakis Award and Adi Shamir · See more »

American Airlines Flight 965

American Airlines Flight 965 was a regularly scheduled flight from Miami International Airport in Miami, Florida, to Alfonso Bonilla Aragón International Airport in Cali, Colombia.

New!!: Paris Kanellakis Award and American Airlines Flight 965 · See more »

Amos Fiat

Amos Fiat (born December 1, 1956 in Haifa, Israel) is an Israeli computer scientist, a professor of computer science at Tel Aviv University.

New!!: Paris Kanellakis Award and Amos Fiat · See more »

Andrei Broder

Andrei Zary Broder (אנדרי זרי ברודר) is a Distinguished Scientist at Google.

New!!: Paris Kanellakis Award and Andrei Broder · See more »

Association for Computing Machinery

The Association for Computing Machinery (ACM) is an international learned society for computing.

New!!: Paris Kanellakis Award and Association for Computing Machinery · See more »

Bioinformatics

Bioinformatics is an interdisciplinary field that develops methods and software tools for understanding biological data.

New!!: Paris Kanellakis Award and Bioinformatics · See more »

Boosting (machine learning)

Boosting is a machine learning ensemble meta-algorithm for primarily reducing bias, and also variance in supervised learning, and a family of machine learning algorithms that convert weak learners to strong ones.

New!!: Paris Kanellakis Award and Boosting (machine learning) · See more »

Broadcast encryption

Broadcast encryption is the cryptographic problem of delivering encrypted content (e.g. TV programs or data on DVDs) over a broadcast channel in such a way that only qualified users (e.g. subscribers who have paid their fees or DVD players conforming to a specification) can decrypt the content.

New!!: Paris Kanellakis Award and Broadcast encryption · See more »

Brown University

Brown University is a private Ivy League research university in Providence, Rhode Island, United States.

New!!: Paris Kanellakis Award and Brown University · See more »

Bruno Buchberger

Bruno Buchberger (born October 22, 1942 in Innsbruck) is Professor of Computer Mathematics at Johannes Kepler University in Linz, Austria.

New!!: Paris Kanellakis Award and Bruno Buchberger · See more »

Cell (biology)

The cell (from Latin cella, meaning "small room") is the basic structural, functional, and biological unit of all known living organisms.

New!!: Paris Kanellakis Award and Cell (biology) · See more »

Charles E. Leiserson

Charles Eric Leiserson is a computer scientist, specializing in the theory of parallel computing and distributed computing, and particularly practical applications thereof.

New!!: Paris Kanellakis Award and Charles E. Leiserson · See more »

Circuit design

The process of circuit design can cover systems ranging from complex electronic systems all the way down to the individual transistors within an integrated circuit.

New!!: Paris Kanellakis Award and Circuit design · See more »

Computer algebra system

A computer algebra system (CAS) is any mathematical software with the ability to manipulate mathematical expressions in a way similar to the traditional manual computations of mathematicians and scientists.

New!!: Paris Kanellakis Award and Computer algebra system · See more »

Computer scientist

A computer scientist is a person who has acquired the knowledge of computer science, the study of the theoretical foundations of information and computation and their application.

New!!: Paris Kanellakis Award and Computer scientist · See more »

Computer vision

Computer vision is a field that deals with how computers can be made for gaining high-level understanding from digital images or videos.

New!!: Paris Kanellakis Award and Computer vision · See more »

Computer-aided design

Computer-aided design (CAD) is the use of computer systems to aid in the creation, modification, analysis, or optimization of a design.

New!!: Paris Kanellakis Award and Computer-aided design · See more »

Corinna Cortes

Corinna Cortes is a Danish computer scientist known for her contributions to machine learning.

New!!: Paris Kanellakis Award and Corinna Cortes · See more »

Cryptography

Cryptography or cryptology (from κρυπτός|translit.

New!!: Paris Kanellakis Award and Cryptography · See more »

Daniel Sleator

Daniel Dominic Kaplan Sleator (born 10 December 1953 in St. Louis) is a Professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States.

New!!: Paris Kanellakis Award and Daniel Sleator · See more »

Data compression

In signal processing, data compression, source coding, or bit-rate reduction involves encoding information using fewer bits than the original representation.

New!!: Paris Kanellakis Award and Data compression · See more »

Data compression ratio

Data compression ratio, also known as compression power, is a computer science term used to quantify the reduction in data-representation size produced by a data compression algorithm.

New!!: Paris Kanellakis Award and Data compression ratio · See more »

Data structure

In computer science, a data structure is a data organization and storage format that enables efficient access and modification.

New!!: Paris Kanellakis Award and Data structure · See more »

DNA

Deoxyribonucleic acid (DNA) is a thread-like chain of nucleotides carrying the genetic instructions used in the growth, development, functioning and reproduction of all known living organisms and many viruses.

New!!: Paris Kanellakis Award and DNA · See more »

E. Allen Emerson

Ernest Allen Emerson (born June 2, 1954) is a computer scientist and endowed professor at the University of Texas, Austin, United States.

New!!: Paris Kanellakis Award and E. Allen Emerson · See more »

Edmund M. Clarke

Edmund Melson Clarke, Jr. (born July 27, 1945) is an American retired computer scientist and academic noted for developing model checking, a method for formally verifying hardware and software designs.

New!!: Paris Kanellakis Award and Edmund M. Clarke · See more »

Electronic design automation

Electronic design automation (EDA), also referred to as electronic computer-aided design (ECAD), is a category of software tools for designing electronic systems such as integrated circuits and printed circuit boards.

New!!: Paris Kanellakis Award and Electronic design automation · See more »

Electronics

Electronics is the discipline dealing with the development and application of devices and systems involving the flow of electrons in a vacuum, in gaseous media, and in semiconductors.

New!!: Paris Kanellakis Award and Electronics · See more »

Email filtering

Email filtering is the processing of email to organize it according to specified criteria.

New!!: Paris Kanellakis Award and Email filtering · See more »

Erasure code

In coding theory, an erasure code is a forward error correction (FEC) code under the assumption of bit erasures (rather than bit errors), which transforms a message of k symbols into a longer message (code word) with n symbols such that the original message can be recovered from a subset of the n symbols.

New!!: Paris Kanellakis Award and Erasure code · See more »

Eugene Myers

Eugene Wimberly "Gene" Myers, Jr. (born December 31, 1953) is an American computer scientist and bioinformatician, who is best known for contributing to the early development of the NCBI's BLAST tool for sequence analysis.

New!!: Paris Kanellakis Award and Eugene Myers · See more »

Formal verification

In the context of hardware and software systems, formal verification is the act of proving or disproving the correctness of intended algorithms underlying a system with respect to a certain formal specification or property, using formal methods of mathematics.

New!!: Paris Kanellakis Award and Formal verification · See more »

Gary Miller (computer scientist)

Gary Lee Miller is a professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States.

New!!: Paris Kanellakis Award and Gary Miller (computer scientist) · See more »

Gene

In biology, a gene is a sequence of DNA or RNA that codes for a molecule that has a function.

New!!: Paris Kanellakis Award and Gene · See more »

Geographic information system

A geographic information system (GIS) is a system designed to capture, store, manipulate, analyze, manage, and present spatial or geographic data.

New!!: Paris Kanellakis Award and Geographic information system · See more »

Gerard J. Holzmann

Gerard J. Holzmann (born 1951) is a Dutch-born American computer scientist and researcher at Bell Labs and NASA, best known as the developer of the SPIN model checker.

New!!: Paris Kanellakis Award and Gerard J. Holzmann · See more »

Gröbner basis

In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring over a field.

New!!: Paris Kanellakis Award and Gröbner basis · See more »

Hanan Samet

Hanan Samet is a Computer Science researcher and Distinguished University Professor at the University of Maryland's Computer Science Department, which is part of the University of Maryland College of Computer, Mathematical, and Natural Sciences.

New!!: Paris Kanellakis Award and Hanan Samet · See more »

Information retrieval

Information retrieval (IR) is the activity of obtaining information system resources relevant to an information need from a collection of information resources.

New!!: Paris Kanellakis Award and Information retrieval · See more »

Interior-point method

Interior-point methods (also referred to as barrier methods) are a certain class of algorithms that solve linear and nonlinear convex optimization problems.

New!!: Paris Kanellakis Award and Interior-point method · See more »

Internet security

Internet security is a branch of computer security specifically related to the Internet, often involving browser security but also network security on a more general level, as it applies to other applications or operating systems as a whole.

New!!: Paris Kanellakis Award and Internet security · See more »

Intrusion detection system

An intrusion detection system (IDS) is a device or software application that monitors a network or systems for malicious activity or policy violations.

New!!: Paris Kanellakis Award and Intrusion detection system · See more »

James Demmel

James Weldon Demmel is an American mathematician and computer scientist, the Dr.

New!!: Paris Kanellakis Award and James Demmel · See more »

Kurt Mehlhorn

Kurt Mehlhorn (born 29 August 1949) is a German theoretical computer scientist.

New!!: Paris Kanellakis Award and Kurt Mehlhorn · See more »

Leonard Adleman

Leonard Adleman (born December 31, 1945) is an American computer scientist.

New!!: Paris Kanellakis Award and Leonard Adleman · See more »

Library of Efficient Data types and Algorithms

The Library of Efficient Data types and Algorithms (LEDA) is a proprietarily-licensed software library providing C++ implementations of a broad variety of algorithms for graph theory and computational geometry.

New!!: Paris Kanellakis Award and Library of Efficient Data types and Algorithms · See more »

Linear programming

Linear programming (LP, also called linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships.

New!!: Paris Kanellakis Award and Linear programming · See more »

Locality-sensitive hashing

Locality-sensitive hashing (LSH) reduces the dimensionality of high-dimensional data.

New!!: Paris Kanellakis Award and Locality-sensitive hashing · See more »

Logic synthesis

In electronics, logic synthesis is a process by which an abstract form of desired circuit behavior, typically at register transfer level (RTL), is turned into a design implementation in terms of logic gates, typically by a computer program called a synthesis tool.

New!!: Paris Kanellakis Award and Logic synthesis · See more »

LZ77 and LZ78

LZ77 and LZ78 are the two lossless data compression algorithms published in papers by Abraham Lempel and Jacob Ziv in 1977 and 1978.

New!!: Paris Kanellakis Award and LZ77 and LZ78 · See more »

Machine learning

Machine learning is a subset of artificial intelligence in the field of computer science that often uses statistical techniques to give computers the ability to "learn" (i.e., progressively improve performance on a specific task) with data, without being explicitly programmed.

New!!: Paris Kanellakis Award and Machine learning · See more »

Market segmentation

Market segmentation is the process of dividing a broad consumer or business market, normally consisting of existing and potential customers, into sub-groups of consumers (known as segments) based on some type of shared characteristics.

New!!: Paris Kanellakis Award and Market segmentation · See more »

Martin Hellman

Martin Edward Hellman (born October 2, 1945) is an American cryptologist, best known for his invention of public key cryptography in cooperation with Whitfield Diffie and Ralph Merkle.

New!!: Paris Kanellakis Award and Martin Hellman · See more »

Medical diagnosis

Medical diagnosis (abbreviated Dx or DS) is the process of determining which disease or condition explains a person's symptoms and signs.

New!!: Paris Kanellakis Award and Medical diagnosis · See more »

Michael Luby

Michael George Luby is a mathematician and computer scientist, VP Technology at Qualcomm, co-founder and former Chief Technology Officer of Digital Fountain.

New!!: Paris Kanellakis Award and Michael Luby · See more »

Michael O. Rabin

Michael Oser Rabin (מִיכָאֵל עוזר רַבִּין, born September 1, 1931) is an Israeli computer scientist and a recipient of the Turing Award.

New!!: Paris Kanellakis Award and Michael O. Rabin · See more »

Mihir Bellare

Mihir Bellare is a cryptographer and professor at the University of California San Diego.

New!!: Paris Kanellakis Award and Mihir Bellare · See more »

Miller–Rabin primality test

The Miller–Rabin primality test or Rabin–Miller primality test is a primality test: an algorithm which determines whether a given number is prime, similar to the Fermat primality test and the Solovay–Strassen primality test.

New!!: Paris Kanellakis Award and Miller–Rabin primality test · See more »

Model checking

In computer science, model checking or property checking refers to the following problem: Given a model of a system, exhaustively and automatically check whether this model meets a given specification.

New!!: Paris Kanellakis Award and Model checking · See more »

Moni Naor

Moni Naor (מוני נאור) is an Israeli computer scientist, currently a professor at the Weizmann Institute of Science.

New!!: Paris Kanellakis Award and Moni Naor · See more »

Moses Charikar

Moses Samson Charikar is an Indian computer scientist who works as a professor at Stanford University.

New!!: Paris Kanellakis Award and Moses Charikar · See more »

Moshe Vardi

Moshe Ya'akov Vardi (משה יעקב ורדי) is an Israeli mathematician and computer scientist.

New!!: Paris Kanellakis Award and Moshe Vardi · See more »

Narendra Karmarkar

Narendra Krishna Karmarkar (born 1957) is an Indian mathematician, who developed Karmarkar's algorithm.

New!!: Paris Kanellakis Award and Narendra Karmarkar · See more »

Optical character recognition

Optical character recognition (also optical character reader, OCR) is the mechanical or electronic conversion of images of typed, handwritten or printed text into machine-encoded text, whether from a scanned document, a photo of a document, a scene-photo (for example the text on signs and billboards in a landscape photo) or from subtitle text superimposed on an image (for example from a television broadcast).

New!!: Paris Kanellakis Award and Optical character recognition · See more »

Paris Kanellakis

Paris Christos Kanellakis (Πάρις Χρήστος Κανελλάκης; December 3, 1953 – December 20, 1995) was a Greek American computer scientist.

New!!: Paris Kanellakis Award and Paris Kanellakis · See more »

Peter Franaszek

Peter A. Franaszek is an American information theorist, an IEEE Fellow, a research staff member emeritus at the IBM T.J. Watson Research Center and a former member of the IBM Academy of Technology.

New!!: Paris Kanellakis Award and Peter Franaszek · See more »

Phillip Rogaway

Phillip Rogaway is a professor of computer science at the University of California, Davis.

New!!: Paris Kanellakis Award and Phillip Rogaway · See more »

Pierre Wolper

Pierre Wolper is a Belgian computer scientist at the University of Liège.

New!!: Paris Kanellakis Award and Pierre Wolper · See more »

Piotr Indyk

Piotr Indyk is a Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology.

New!!: Paris Kanellakis Award and Piotr Indyk · See more »

Primality test

A primality test is an algorithm for determining whether an input number is prime.

New!!: Paris Kanellakis Award and Primality test · See more »

Provable security

Provable security refers to any type or level of security that can be proved.

New!!: Paris Kanellakis Award and Provable security · See more »

Public-key cryptography

Public-key cryptography, or asymmetric cryptography, is any cryptographic system that uses pairs of keys: public keys which may be disseminated widely, and private keys which are known only to the owner.

New!!: Paris Kanellakis Award and Public-key cryptography · See more »

Quadtree

A quadtree is a tree data structure in which each internal node has exactly four children.

New!!: Paris Kanellakis Award and Quadtree · See more »

Ralph Merkle

Ralph C. Merkle (born February 2, 1952) is a computer scientist.

New!!: Paris Kanellakis Award and Ralph Merkle · See more »

Randal Bryant

Randal E. Bryant (born October 27, 1952) is an American computer scientist and academic noted for his research on formally verifying digital hardware and software.

New!!: Paris Kanellakis Award and Randal Bryant · See more »

Regression analysis

In statistical modeling, regression analysis is a set of statistical processes for estimating the relationships among variables.

New!!: Paris Kanellakis Award and Regression analysis · See more »

Robert M. Solovay

Robert Martin Solovay (born December 15, 1938) is an American mathematician specializing in set theory.

New!!: Paris Kanellakis Award and Robert M. Solovay · See more »

Robert Schapire

Robert Elias Schapire is an American computer scientist, former David M. Siegel '83 Professor in the computer science department at Princeton University, and has recently moved to Microsoft Research.

New!!: Paris Kanellakis Award and Robert Schapire · See more »

Robert Tarjan

Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician.

New!!: Paris Kanellakis Award and Robert Tarjan · See more »

Ron Rivest

Ronald Linn Rivest (born May 6, 1947) is a cryptographer and an Institute Professor at MIT.

New!!: Paris Kanellakis Award and Ron Rivest · See more »

SIGMOD

SIGMOD is the Association for Computing Machinery's Special Interest Group on Management of Data, which specializes in large-scale data management problems and databases.

New!!: Paris Kanellakis Award and SIGMOD · See more »

Signal processing

Signal processing concerns the analysis, synthesis, and modification of signals, which are broadly defined as functions conveying "information about the behavior or attributes of some phenomenon", such as sound, images, and biological measurements.

New!!: Paris Kanellakis Award and Signal processing · See more »

SIGPLAN

SIGPLAN is the Association for Computing Machinery's Special Interest Group on programming languages.

New!!: Paris Kanellakis Award and SIGPLAN · See more »

Simulation

Simulation is the imitation of the operation of a real-world process or system.

New!!: Paris Kanellakis Award and Simulation · See more »

Solovay–Strassen primality test

The Solovay–Strassen primality test, developed by Robert M. Solovay and Volker Strassen, is a probabilistic test to determine if a number is composite or probably prime.

New!!: Paris Kanellakis Award and Solovay–Strassen primality test · See more »

Special Interest Group on Design Automation

SIGDA, Association for Computing Machinery's Special Interest Group on Design Automation, is a professional development organization for the Electronic Design Automation (EDA) community.

New!!: Paris Kanellakis Award and Special Interest Group on Design Automation · See more »

Splay tree

A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again.

New!!: Paris Kanellakis Award and Splay tree · See more »

Statistical classification

In machine learning and statistics, classification is the problem of identifying to which of a set of categories (sub-populations) a new observation belongs, on the basis of a training set of data containing observations (or instances) whose category membership is known.

New!!: Paris Kanellakis Award and Statistical classification · See more »

Supervised learning

Supervised learning is the machine learning task of learning a function that maps an input to an output based on example input-output pairs.

New!!: Paris Kanellakis Award and Supervised learning · See more »

Support vector machine

In machine learning, support vector machines (SVMs, also support vector networks) are supervised learning models with associated learning algorithms that analyze data used for classification and regression analysis.

New!!: Paris Kanellakis Award and Support vector machine · See more »

Telecommunication

Telecommunication is the transmission of signs, signals, messages, words, writings, images and sounds or information of any nature by wire, radio, optical or other electromagnetic systems.

New!!: Paris Kanellakis Award and Telecommunication · See more »

Time complexity

In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.

New!!: Paris Kanellakis Award and Time complexity · See more »

Traitor tracing

Traitor tracing schemes help trace the source of leaks when secret or proprietary data is sold to many customers.

New!!: Paris Kanellakis Award and Traitor tracing · See more »

Vladimir Vapnik

Vladimir Naumovich Vapnik (Владимир Наумович Вапник; born 6 December 1936) is one of the main developers of the Vapnik–Chervonenkis theory of statistical learning, and the co-inventor of the support vector machine method, and support vector clustering algorithm.

New!!: Paris Kanellakis Award and Vladimir Vapnik · See more »

Volker Strassen

Volker Strassen (born April 29, 1936) is a German mathematician, a professor emeritus in the department of mathematics and statistics at the University of Konstanz.

New!!: Paris Kanellakis Award and Volker Strassen · See more »

Weather forecasting

Weather forecasting is the application of science and technology to predict the conditions of the atmosphere for a given location and time.

New!!: Paris Kanellakis Award and Weather forecasting · See more »

Whitfield Diffie

Bailey Whitfield 'Whit' Diffie (born June 5, 1944) is an American cryptographer and one of the pioneers of public-key cryptography along with Martin Hellman and Ralph Merkle.

New!!: Paris Kanellakis Award and Whitfield Diffie · See more »

Whole genome sequencing

Whole genome sequencing (also known as WGS, full genome sequencing, complete genome sequencing, or entire genome sequencing) is the process of determining the complete DNA sequence of an organism's genome at a single time.

New!!: Paris Kanellakis Award and Whole genome sequencing · See more »

Work stealing

In parallel computing, work stealing is a scheduling strategy for multithreaded computer programs.

New!!: Paris Kanellakis Award and Work stealing · See more »

Yaakov Ziv

Yaakov Ziv (יעקב זיו; born 1931) is an Israeli electrical engineer who, along with Abraham Lempel, developed the LZ family of lossless data compression algorithms.

New!!: Paris Kanellakis Award and Yaakov Ziv · See more »

Yoav Freund

Yoav Freund (יואב פרוינד) is an Israeli professor of computer science at the University of California San Diego who mainly works on machine learning, probability theory and related fields and applications.

New!!: Paris Kanellakis Award and Yoav Freund · See more »

8b/10b encoding

In telecommunications, 8b/10b is a line code that maps 8-bit words to 10-bit symbols to achieve DC-balance and bounded disparity, and yet provide enough state changes to allow reasonable clock recovery.

New!!: Paris Kanellakis Award and 8b/10b encoding · See more »

Redirects here:

Kanellakis Award, Paris Kanellakis Theory and Practice Award.

References

[1] https://en.wikipedia.org/wiki/Paris_Kanellakis_Award

OutgoingIncoming
Hey! We are on Facebook now! »