1091 search results - page 206 / 219 » On the temporal dimension of search |
109
click to vote
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
105
click to vote
EPS
1998
Springer
15 years 4 months ago
1998
Springer
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
110
click to vote
EDBT
2009
ACM
15 years 3 months ago
2009
ACM
Given a set P of products, a set O of customers, and a product p P, a bichromatic reverse skyline query retrieves all the customers in O that do not find any other product in P t...
111
click to vote
KDD
2000
ACM
15 years 3 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...