943 search results - page 29 / 189 » How should data structures and algorithms be taught |
HIPC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally,...
188
Voted
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
147
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Sharing structured data today requires standardizing upon a single schema, then mapping and cleaning all of the data. This results in a single queriable mediated data instance. Ho...
168
click to vote
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
We are witnessing in recent years growing interest for location-dependent information services among mobile users. This paper examines the issue of processing locationdependent qu...
AUSDM
2006
Springer
15 years 1 months ago
2006
Springer
When different subsamples of the same data set are used to induce classification trees, the structure of the built classifiers is very different. The stability of the structure of ...