254 search results - page 37 / 51 » Efficient Implementation of the Generalized Tunstall Code Ge... |
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Automatic recognition of named entities such as people, places, organizations, books, and movies across the entire web presents a number of challenges, both of scale and scope. Da...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
159
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
105
click to vote
ICDT
2001
ACM
15 years 2 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
107
click to vote
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
The advent of general purpose graphics processing units (GPGPU's) brings about a whole new platform for running numerically intensive applications at high speeds. Their multi-...