7150 search results - page 252 / 1430 » An Approximation Algorithm for Approximation Rank |
418
click to vote
ICDE
2000
IEEE
16 years 8 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
272
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
164
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...
187
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
182
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...