16404 search results - page 902 / 3281 » A set coverage problem |
212
Voted
DAWAK
2003
Springer
16 years 27 days ago
2003
Springer
Abstract. This paper describes the use of a concept hierarchy for improving the results of association rule mining. Given a large set of tuples with demographic information and per...
206
click to vote
WAIM
2009
Springer
16 years 6 days 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 ...
199
click to vote
RTSS
2000
IEEE
16 years 1 days ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
249
Voted
STOC
1999
ACM
15 years 12 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
220
click to vote
CGI
2009
IEEE
15 years 11 months ago
2009
IEEE
Two dimensional point data can be considered one of the most basic, yet one of the most ubiquitous data types arising in a wide variety of applications. The basic scatter plot app...