data compression facility
11Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity. Computer scientist Manindra Agrawal of the… …
12Moving Picture Experts Group — MPEG logo MPEG redirects here. For the guild, see Motion Picture Editors Guild. For the unaffiliated company that licenses patent pools for some MPEG standards, see MPEG LA …
13Deep Space Network — This article is about the deep space communication network of JPL and NASA. For the network of low cost interplanetary trajectories, see Interplanetary Transport Network. Deep Space Network …
14Galileo (spacecraft) — Infobox Spacecraft Name = Galileo Orbiter Caption = Galileo is prepared for mating with the IUS booster Organization = NASA Major Contractors = Mission Type = Orbiter, fly by Flyby Of = Venus, Earth, 951 Gaspra, 243 Ida Satellite Of = Jupiter… …
15Digital Audio Broadcasting — For other digital audio broadcasting systems, see Digital radio.   Countries with regular services …
16List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… …
17Pogo Mobile and nVoy — The Pogo Mobile was a GSM based mobile device developed by British start up Pogo Technology Ltd. It combined web browsing, messaging, audio playback and phone functionality in a portable form.It used a server side compression system to shrink web …
18Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive …
19Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… …
20Liste de problèmes NP-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problème de décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive. La …
