3405 search results - page 143 / 681 » Factoring Groups Efficiently |
186
click to vote
CIKM
1998
Springer
15 years 10 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
147
click to vote
IPPS
1996
IEEE
15 years 10 months ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
159
click to vote
ACG
2006
Springer
15 years 10 months ago
2006
Springer
Amazons is a two-player perfect information game with a high branching factor, particularly in the opening. Therefore, improving the efficiency of the search is important for impro...
162
click to vote
ADC
2004
Springer
15 years 10 months ago
2004
Springer
Most modern database applications contain a significant amount of time dependent data and a substantial proportion of this data is now-relative, i.e. current now. While much resea...
173
click to vote
VLDB
1995
ACM
15 years 10 months ago
1995
ACM
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an effic...