1308 search results - page 97 / 262 » Let's Have a Conversation |
105
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
COMPUTER
2007
14 years 11 months ago
2007
ract in that they deal with sequences of sound or movement. Two social or personality skills can also be defined: Intrapersonal skill helps people perceive and control their own th...
ENDM
2007
14 years 11 months ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
EATCS
2002
14 years 11 months ago
2002
We solve the general case of the bridge-crossing puzzle. 1 The Puzzle Four people begin on the same side of a bridge. You must help them across to the other side. It is night. The...
125
click to vote
CCGRID
2010
IEEE
14 years 8 months ago
2010
IEEE
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...