Graph-iti

(noun), graph + graphiti
шутл. таблица или график, напоминающий граффити

Англо-русский словарь. Современные тенденции в словообразовании. Контаминанты. — М. : Флинта : Наука. . 2009.

Смотреть что такое "Graph-iti" в других словарях:

  • Millions of Us LLC — [3] is a specialty marketing agency focused on virtual worlds and large online communities. Founded in 2006 and based in San Francisco, the agency s clients include 20th Century Fox, Warner Bros., Toyota, Microsoft, and Intel. By late 2007, the… …   Wikipedia

  • Social network service — A social network service focuses on building online communities of people who share interests and activities, or who are interested in exploring the interests and activities of others. Most social network services are web based and provide a… …   Wikipedia

  • Digital exhaust — The term digital exhaust or exhaust data has several meanings but can be defined through the following: The output of human beings using the internet.[1] The aggregation of [consumer] data through the digitization of processes and activities in… …   Wikipedia

  • Ning — Información general URL http://www.ning.com Comercial Sí Tipo de sitio Servicios de red social …   Wikipedia Español

  • Social networking service — This article is about the type of service. For the concept of relationships between people, see Social network. For a list of services, see List of social networking websites. A social networking service is an online service, platform, or site… …   Wikipedia

  • Ning (website) — Ning, Inc. Type Private Founded Palo Alto, California (2004 (2004))[ …   Wikipedia

  • Ning — URL: ning.com Коммерческий: Да Тип сайта: Социальная сеть Регистрация …   Википедия

  • Algorithmus von Dijkstra — Der Algorithmus von Dijkstra (nach seinem Erfinder Edsger W. Dijkstra) dient der Berechnung eines kürzesten Pfades zwischen einem Startknoten und einem beliebigen Knoten in einem kantengewichteten Graphen. Die Gewichte dürfen dabei nicht negativ… …   Deutsch Wikipedia

  • Dijkstraalgorithmus — Der Algorithmus von Dijkstra (nach seinem Erfinder Edsger W. Dijkstra) dient der Berechnung eines kürzesten Pfades zwischen einem Startknoten und einem beliebigen Knoten in einem kantengewichteten Graphen. Die Gewichte dürfen dabei nicht negativ… …   Deutsch Wikipedia

  • Dijkstras Algorithmus — Der Algorithmus von Dijkstra (nach seinem Erfinder Edsger W. Dijkstra) dient der Berechnung eines kürzesten Pfades zwischen einem Startknoten und einem beliebigen Knoten in einem kantengewichteten Graphen. Die Gewichte dürfen dabei nicht negativ… …   Deutsch Wikipedia

  • Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… …   Wikipedia

Книги


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.