879 search results - page 24 / 176 » Greedy Attribute Selection |
SIGMOD
2003
ACM
14 years 9 months ago
2003
ACM
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
WSC
1998
13 years 11 months ago
1998
In this paper, we develop a ranking and selection procedure for making multiple comparisons of systems that have multiple performance measures. The procedure combines multiple att...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
CLEF
2010
Springer
13 years 7 months ago
2010
Springer
Abstract This paper describes the University of Sheffield entry for the 2nd international plagiarism detection competition (PAN 2010). Our system attempts to identify extrinsic pla...
JMLR
2010
13 years 4 months ago
2010
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...