1403 search results - page 177 / 281 » Set cover algorithms for very large datasets |
208
click to vote
ICDAR
2011
IEEE
14 years 5 months ago
2011
IEEE
— This paper presents a new method based on Fourier and moments features to extract words and characters from a video text line in any direction for recognition. Unlike existing ...
126
click to vote
IRI
2007
IEEE
16 years 13 days ago
2007
IEEE
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...
166
click to vote
WAIM
2009
Springer
15 years 10 months ago
2009
Springer
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
170
Voted
ISCI
2008
15 years 6 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
187
click to vote
ICPR
2010
IEEE
16 years 1 months ago
2010
IEEE
In this paper we address the problem of relighting faces in presence of cast shadows and specularities. We present a solution to this problem by capturing the spatially varying Ap...