163 search results - page 19 / 33 » Improving the Context-sensitive Dependency Graph |
ECTEL
2007
Springer
14 years 1 months ago
2007
Springer
This paper describes an initiative aimed at adapting swarm intelligence techniques (in particular, Ant Colony Optimization) to an e-learning environment, thanks to the fact that th...
IM
2007
13 years 7 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
MM
2010
ACM
13 years 7 months ago
2010
ACM
The major scientific problem for content-based video retrieval is the semantic gap. Generally speaking, there are two appropriate ways to bridge the semantic gap: the first one is...
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...