1830 search results - page 60 / 366 » Workshop on Graph Computation Models |
116
click to vote
RECOMB
2008
Springer
16 years 2 months ago
2008
Springer
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
125
click to vote
ICDAR
2007
IEEE
15 years 8 months ago
2007
IEEE
The Machine Learning and Pattern Recognition communities are facing two challenges: solving the normalization problem, and solving the deep learning problem. The normalization pro...
124
click to vote
CP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
116
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
140
click to vote
EMMCVPR
2005
Springer
15 years 7 months ago
2005
Springer
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...