8220 search results - page 1559 / 1644 » Querying XML Data |
CSR
2006
Springer
13 years 12 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
DAGM
2006
Springer
13 years 12 months ago
2006
Springer
In real world scenes, objects to be classified are usually not visible from every direction, since they are almost always positioned on some kind of opaque plane. When moving a cam...
DAS
2006
Springer
13 years 12 months ago
2006
Springer
An efficient adaptive document classification and categorization approach is proposed for personal file creation corresponding to user's specific needs and profile. This kind ...
CIARP
2003
Springer
13 years 11 months ago
2003
Springer
Classification problems are traditionally focused on uniclass samples, that is, each sample of the training and test sets has one unique label, which is the target of the classific...
CVPR
2000
IEEE
13 years 11 months ago
2000
IEEE
Nearest neighbor classification assumes locally constant class conditional probabilities. This assumption becomes invalid in high dimensions with finite samples due to the curse o...