3204 search results - page 409 / 641 » The Alcuin Number of a Graph |
204
click to vote
ALMOB
2006
15 years 7 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
176
click to vote
EC
2007
15 years 6 months ago
2007
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly r...
192
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
In this paper, we present a compositional boosting algorithm for detecting and recognizing 17 common image structures in low-middle level vision tasks. These structures, called &q...
209
click to vote
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
167
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...