7150 search results - page 1382 / 1430 » An Approximation Algorithm for Approximation Rank |
108
click to vote
KDD
2001
ACM
16 years 27 days 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 ...
102
Voted
CHI
2004
ACM
16 years 26 days 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., ...
198
Voted
POPL
2006
ACM
16 years 25 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...
100
Voted
ICALP
2009
Springer
16 years 24 days 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...
199
click to vote
VLDB
2003
ACM
16 years 22 days ago
2003
ACM
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...