4926 search results - page 416 / 986 » Two Graph Algorithms On an Associative Computing Model |
145
click to vote
PRL
2008
15 years 3 months ago
2008
The handwriting is one of the most familiar communication media. Pen based interface combined with automatic handwriting recognition offers a very easy and natural input method. T...
149
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we address the problem of finding gene regulatory networks from experimental DNA microarray data. We focus on the evaluation of the performance of different evoluti...
145
click to vote
CVPR
2010
IEEE
16 years 24 days ago
2010
IEEE
Many feature detection algorithms rely on the choice of scale. In this paper, we complement standard scaleselection algorithms with spatial regularization. To this end, we formula...
141
click to vote
WG
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
169
Voted
ADHOCNOW
2004
Springer
15 years 9 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...