1143 search results - page 55 / 229 » pairing 2007 |
DM
2007
13 years 10 months ago
2007
A graph G is quadrangularly connected if for every pair of edges e1 and e2 in E(G), G has a sequence of l-cycles (3 ≤ l ≤ 4)
STOC
2007
ACM
14 years 10 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
ICDE
2007
IEEE
14 years 11 months ago
2007
IEEE
Data sources for data integration often come with spurious schema definitions such as undefined foreign key constraints. Such metadata are important for querying the database and ...
ICIAP
2007
ACM
14 years 10 months ago
2007
ACM
We address the synchronization of a pair of video sequences captured from moving vehicles and the spatial registration of all the temporally corresponding frames. This is necessar...
ICDAR
2007
IEEE
14 years 4 months ago
2007
IEEE
In this paper, we propose a linear discriminant analysis (LDA)-based compound distance measure for discriminating similar characters in handwritten Chinese character recognition. ...