HOME
*





Color-coding
In computer science and graph theory, the term color-coding refers to an algorithmic technique which is useful in the discovery of network motifs. For example, it can be used to detect a simple path of length in a given graph. The traditional color-coding algorithm is probabilistic, but it can be derandomized without much overhead in the running time. Color-coding also applies to the detection of cycles of a given length, and more generally it applies to the subgraph isomorphism problem (an NP-complete problem), where it yields polynomial time algorithms when the subgraph pattern that it is trying to detect has bounded treewidth. The color-coding method was proposed and analyzed in 1994 by Noga Alon, Raphael Yuster, and Uri Zwick.Alon, N., Yuster, R., and Zwick, U. 1995. Color-coding. J. ACM 42, 4 (Jul. 1995), 844–856. DOI= http://doi.acm.org/10.1145/210332.210337 Results The following results can be obtained through the method of color-coding: * For every fixed cons ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Noga Alon
Noga Alon ( he, נוגה אלון; born 17 February 1956) is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers. Academic background Alon is a Professor of Mathematics at Princeton University and a Baumritter Professor Emeritus of Mathematics and Computer Science at Tel Aviv University, Israel. He graduated from the Hebrew Reali School in 1974 and received his Ph.D. in Mathematics at the Hebrew University of Jerusalem in 1983 and had visiting positions in various research institutes including MIT, The Institute for Advanced Study in Princeton, IBM Almaden Research Center, Bell Labs, Bellcore and Microsoft Research. He serves on the editorial boards of more than a dozen international journals; since 2008 he is the editor-in-chief of ''Random Structures and Algorithms''. He has given lectures in many conferences, including plenary addresses ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Network Motif
Network motifs are recurrent and statistically significant Subgraph (graph theory), subgraphs or patterns of a larger complex network, graph. All networks, including biological networks, social networks, technological networks (e.g., computer networks and electrical circuits) and more, can be represented as graphs, which include a wide variety of subgraphs. Network motifs are sub-graphs that repeat themselves in a specific network or even among various networks. Each of these sub-graphs, defined by a particular pattern of interactions between vertices, may reflect a framework in which particular functions are achieved efficiently. Indeed, motifs are of notable importance largely because they may reflect functional properties. They have recently gathered much attention as a useful concept to uncover structural design principles of complex networks. Although network motifs may provide a deep insight into the network's functional abilities, their detection is computationally challengi ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Computer Science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical disciplines (including the design and implementation of Computer architecture, hardware and Computer programming, software). Computer science is generally considered an area of research, academic research and distinct from computer programming. Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and for preventing Vulnerability (computing), security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Progr ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Minor (graph Theory)
Minor may refer to: * Minor (law), a person under the age of certain legal activities. ** A person who has not reached the age of majority * Academic minor, a secondary field of study in undergraduate education Music theory *Minor chord ** Barbershop seventh chord or minor seventh chord *Minor interval *Minor key *Minor scale Mathematics * Minor (graph theory), the relation of one graph to another given certain conditions * Minor (linear algebra), the determinant of a certain submatrix People * Charles Minor (1835–1903), American college administrator * Charles A. Minor (21st-century), Liberian diplomat * Dan Minor (1909–1982), American jazz trombonist * Dave Minor (1922–1998), American basketball player * James T. Minor, US academic administrator and sociologist * Jerry Minor (born 1969), American actor, comedian and writer * Kyle Minor (born 1976), American writer * Mike Minor (actor) (born 1940), American actor * Mike Minor (baseball) (born 1987), American baseball p ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Wnt Signaling Pathway
The Wnt signaling pathways are a group of signal transduction pathways which begin with proteins that pass signals into a cell through cell surface receptors. The name Wnt is a portmanteau created from the names Wingless and Int-1. Wnt signaling pathways use either nearby cell-cell communication (paracrine) or same-cell communication (autocrine). They are highly evolutionarily conserved in animals, which means they are similar across animal species from fruit flies to humans. Three Wnt signaling pathways have been characterized: the canonical Wnt pathway, the noncanonical planar cell polarity pathway, and the noncanonical Wnt/calcium pathway. All three pathways are activated by the binding of a Wnt-protein ligand to a Frizzled family receptor, which passes the biological signal to the Dishevelled protein inside the cell. The canonical Wnt pathway leads to regulation of gene transcription, and is thought to be negatively regulated in part by the SPATS1 gene. The noncanonical plana ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


NC (complexity)
In computational complexity theory, the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In other words, a problem with input size ''n'' is in NC if there exist constants ''c'' and ''k'' such that it can be solved in time using parallel processors. Stephen Cook coined the name "Nick's class" after Nick Pippenger, who had done extensive research on circuits with polylogarithmic depth and polynomial size.Arora & Barak (2009) p.120 Just as the class P can be thought of as the tractable problems ( Cobham's thesis), so NC can be thought of as the problems that can be efficiently solved on a parallel computer.Arora & Barak (2009) p.118 NC is a subset of P because polylogarithmic parallel computations can be simulated by polynomial-time sequential ones. It is unknown whether NC = P, but most researchers suspect this to be false, meaning that there are probably some tractable pr ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Jeanette P
Jeanette, Jeannette or Jeanetta may refer to: * Jeanette (given name), a given name (including a list of people and fictional characters with the name) Places * Jeannette, Ontario, Canada * Jeannette Island, Russia * Jeannette, Pennsylvania, U.S. * Jeannette Monument, United States Naval Academy Cemetery, Annapolis, Maryland, U.S. * Jeanette State Forest, Minnesota, U.S. People * Jeanette (Spanish singer) (born 1951), Spanish singer * Jeanette Biedermann, a German singer known mononymously by "Jeanette" * Buddy Jeannette (1917–1998), basketball player and coach * Daniel Jeannette (born 1961), director of animation and FX * Gertrude Jeannette (1914-2018), actress * Gunnar Jeannette (born 1982), racecar driver * Joe Jeanette (1879–1958), heavyweight boxer * Stanick Jeannette (born 1977), figure skater * Jeanette Aw (born 1979), Singaporean actress Other uses * '' Jeannette: The Childhood of Joan of Arc'', 2017 French film * Jeannette (comics), a DC Comics character * USS ' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Aravind Srinivasan
Arvind (from sa, अरविन्द ') is a common Indian masculine name meaning lotus. The name is of Hindu origin. Its variants include Aravind, Aravinda, Aravindan, and Aurobindo (). Meaning ' means sun in the Sanskrit language. In particular, the word may refer to the lotus flower, on which the Hindu goddess of wealth and prosperity – Lakshmi – sits. It could also refer to the Sanskrit term ' (meaning the "lotus eyed one"), the 347th name used to describe the Hindu god Vishnu in the Vishnu Sahasranama. Notable people * Arvind Kejriwal, Indian politician and former bureaucrat * Arvind Khanna, Indian politician and businessman * Arvind Panagariya, Indian-American economist, professor of economics at Columbia University * Arvind Pandey, Indian politician * Arvind (computer scientist), Indian-American professor of Computer Science and Engineering at MIT * Arvind Parmar, British tennis player * Arvind Sawant, Indian politician * Arvind Singh Mewar, Indian businessm ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Leonard J
Leonard or ''Leo'' is a common English masculine given name and a surname. The given name and surname originate from the Old High German ''Leonhard'' containing the prefix ''levon'' ("lion") from the Greek Λέων ("lion") through the Latin '' Leo,'' and the suffix ''hardu'' ("brave" or "hardy"). The name has come to mean "lion strength", "lion-strong", or "lion-hearted". Leonard was the name of a Saint in the Middle Ages period, known as the patron saint of prisoners. Leonard is also an Irish origin surname, from the Gaelic ''O'Leannain'' also found as O'Leonard, but often was anglicised to just Leonard, consisting of the prefix ''O'' ("descendant of") and the suffix ''Leannan'' ("lover"). The oldest public records of the surname appear in 1272 in Huntingdonshire, England, and in 1479 in Ulm, Germany. Variations The name has variants in other languages: * Leen, Leendert, Lenard (Dutch) * Lehnertz, Lehnert (Luxembourgish) * Len (English) * :hu:Lénárd (Hungarian) * Lenart ( ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Moni Naor
Moni Naor ( he, מוני נאור) is an Israeli Israeli may refer to: * Something of, from, or related to the State of Israel * Israelis, citizens or permanent residents of the State of Israel * Modern Hebrew, a language * ''Israeli'' (newspaper), published from 2006 to 2008 * Guni Israeli ... computer scientist, currently a professor at the Weizmann Institute of Science. Naor received his Ph.D. in 1989 at the University of California, Berkeley. His advisor was Manuel Blum. He works in various fields of computer science, mainly the foundations of cryptography. He is notable for initiating research on public key systems secure against chosen ciphertext attack and creating Malleability (cryptography), non-malleable cryptography, visual cryptography (with Adi Shamir), and suggesting various methods for verifying that users of a computer system are human (leading to the notion of CAPTCHA). His research on Small-bias sample space, give a general framework for combining small k- ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Perfect Hash
In computer science, a perfect hash function for a set is a hash function that maps distinct elements in to a set of integers, with no collisions. In mathematical terms, it is an injective function. Perfect hash functions may be used to implement a lookup table with constant worst-case access time. A perfect hash function can, as any hash function, be used to implement hash tables, with the advantage that no collision resolution has to be implemented. In addition, if the keys are not the data and if it is known that queried keys will be valid, then the keys do not need to be stored in the lookup table, saving space. Disadvantages of perfect hash functions are that needs to be known for the construction of the perfect hash function. Non-dynamic perfect hash functions need to be re-constructed if changes. For frequently changing dynamic perfect hash functions may be used at the cost of additional space. The space requirement to store the perfect hash function is in . The ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]