7006 search results - page 1362 / 1402 » Approximation Algorithms |
109
Voted
KDD
2006
ACM
16 years 1 months ago
2006
ACM
Motivated by numerous applications in which the data may be modeled by a variable subscripted by three or more indices, we develop a tensor-based extension of the matrix CUR decom...
KDD
2002
ACM
16 years 1 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 ...
109
click to vote
KDD
2001
ACM
16 years 1 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 ...
104
Voted
CHI
2004
ACM
16 years 1 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., ...
201
Voted
POPL
2006
ACM
16 years 28 days 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...