16934 search results - page 3017 / 3387 » Offshoring Information Technology |
161
Voted
SPIRE
2005
Springer
16 years 1 months ago
2005
Springer
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
188
click to vote
SPIRE
2005
Springer
16 years 1 months ago
2005
Springer
Large inverted indices are by now common in the construction of web-scale search engines. For faster access, inverted indices are indexed internally so that it is possible to skip...
153
Voted
SPIRE
2005
Springer
16 years 1 months ago
2005
Springer
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
177
click to vote
SPIRE
2005
Springer
16 years 1 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
240
click to vote
SPIRE
2005
Springer
16 years 1 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...