88 search results - page 10 / 18 » Sublinear Algorithms for Parameterized Matching |
110
click to vote
NIPS
1997
14 years 10 months ago
1997
We study on-line generalized linear regression with multidimensional outputs, i.e., neural networks with multiple output nodes but no hidden nodes. We allow at the final layer tra...
WABI
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
114
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
The aim of this work is to learn a shape prior model
for an object class and to improve shape matching with the
learned shape prior. Given images of example instances,
we can le...
ASIAN
1998
Springer
15 years 1 months ago
1998
Springer
call it, provides abstraction through the rewriting arrow and explicit rule application. It also embeds the notion of sets of results to deal with non-deterministic computations. F...