567 search results - page 39 / 114 » Exact train pathing |
OTM
2010
Springer
14 years 9 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
DRR
2010
15 years 2 months ago
2010
Scaling up document-image classifiers to handle an unlimited variety of document and image types poses serious challenges to conventional trainable classifier technologies. Highly...
GD
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
113
click to vote
ICASSP
2010
IEEE
15 years 21 hour ago
2010
IEEE
Data sparseness is an ever dominating problem in automatic emotion recognition. Using artificially generated speech for training or adapting models could potentially ease this: t...
CORR
2012
Springer
13 years 7 months ago
2012
Springer
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....