3008 search results - page 69 / 602 » Independence in connected graphs |
187
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper proposes, an efficient method for text independent writer identification using a codebook. The occurrence histogram of the shapes in the codebook is used to create a fea...
176
click to vote
KES
2008
Springer
15 years 6 months ago
2008
Springer
One of the main problems facing the development of ontology-aware authoring systems (OAS) is to link well-designed domain-independent knowledge (ontologies) with domain content. Su...
195
click to vote
GC
2002
Springer
15 years 6 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
350
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from ...
168
click to vote
KR
2010
Springer
15 years 8 months ago
2010
Springer
We study logical principles connecting two relations: independence, which is known as nondeducibility in the study of information flow, and functional dependence. Two different e...