7930 search results - page 1538 / 1586 » Greedy in Approximation Algorithms |
121
Voted
KDD
2002
ACM
16 years 3 months ago
2002
ACM
Recently, there has been increasing interest in the issues of cost-sensitive learning and decision making in a variety of applications of data mining. A number of approaches have ...
135
Voted
KDD
2001
ACM
16 years 3 months ago
2001
ACM
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
142
Voted
CHI
2004
ACM
16 years 3 months ago
2004
ACM
We compare 2D/3D combination displays to displays with 2D and 3D views alone. Combination displays we consider are: orientation icon (i.e., side-by-side), in-place methods (e.g., ...
236
Voted
POPL
2006
ACM
16 years 3 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
129
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...