1568 search results - page 252 / 314 » The problem of examination questions in algorithmics |
125
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
138
click to vote
DM
1998
15 years 3 months ago
1998
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
112
click to vote
JMLR
2002
15 years 3 months ago
2002
A single signal processing algorithm can be represented by many mathematically equivalent formulas. However, when these formulas are implemented in code and run on real machines, ...
145
click to vote
RSA
2008
15 years 3 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
109
click to vote
MICCAI
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Diffusion magnetic resonance imaging has led to active research in the analysis of anatomical connectivity in the brain. Many approaches have been proposed to model the ...