4541 search results - page 242 / 909 » Cache-Oblivious Algorithms and Data Structures |
120
click to vote
ISAAC
2001
Springer
15 years 8 months ago
2001
Springer
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
114
Voted
FIMI
2004
15 years 4 months ago
2004
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
126
Voted
IJCAI
2001
15 years 4 months ago
2001
Constraint propagation is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the us...
119
click to vote
METMBS
2004
15 years 4 months ago
2004
As more research centers embark on sequencing new genomes, the problem of DNA fragment assembly for shotgun sequencing is growing in importance and complexity. Accurate and fast a...
167
click to vote
DEXA
2010
Springer
15 years 27 days ago
2010
Springer
Abstract. There is a significant commercial and research interest in locationbased web search engines. Given a number of search keywords and one or more locations that a user is in...