2988 search results - page 137 / 598 » Experiments with a New Boosting Algorithm |
126
click to vote
FIMI
2004
15 years 6 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...
131
click to vote
EACL
2006
ACL Anthology
15 years 6 months ago
2006
ACL Anthology
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
131
click to vote
METMBS
2004
15 years 6 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...
165
Voted
NETWORKING
2004
15 years 6 months ago
2004
Several new protocols such as RBUDP, User-Level UDP, Tsunami, and SABUL, have been proposed as alternatives to TCP for high speed data transfer. The purpose of this paper is to an...
135
click to vote
MOC
2000
15 years 4 months ago
2000
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...