874 search results - page 163 / 175 » Faster Algorithms for Semi-Matching Problems |
POPL
2008
ACM
14 years 9 months ago
2008
ACM
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
PLDI
2004
ACM
14 years 2 months ago
2004
ACM
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
SIGMOD
1999
ACM
14 years 1 months ago
1999
ACM
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
ICDE
1995
IEEE
14 years 10 months ago
1995
IEEE
Abstract. The problem of mining sequential patterns was recently introduced in 3 . We are given a database of sequences, where each sequence is a list of transactions ordered by tr...