4913 search results - page 246 / 983 » Results and Perspectives of the G |
160
click to vote
TCS
2008
15 years 6 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
172
click to vote
BC
2005
15 years 6 months ago
2005
Grating cells were discovered in the V1 and V2 areas of the monkey visual cortex by von der Heydt et al. (1992). These cells responded vigorously to grating patterns of appropriate...
155
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
151
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
164
click to vote
WALCOM
2010
IEEE
16 years 1 months ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...