4536 search results - page 258 / 908 » Contention-Sensitive Data Structures and Algorithms |
131
click to vote
ICML
2004
IEEE
15 years 8 months ago
2004
IEEE
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
113
click to vote
ISAAC
2001
Springer
15 years 7 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 ...
110
click to vote
METMBS
2004
15 years 3 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...
103
Voted
FIMI
2004
15 years 3 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...
118
Voted
IJCAI
2001
15 years 3 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...