244 search results - page 18 / 49 » Fast Set Intersection in Memory |
DATE
1998
IEEE
14 years 2 months ago
1998
IEEE
We extend the subsequence removal technique to provide signi cantly higher static compaction for sequential circuits. We show that state relaxation techniques can be used to ident...
CORR
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
SCAM
2008
IEEE
14 years 4 months ago
2008
IEEE
—Many software engineering applications require points-to analysis. Client applications range from optimizing compilers to program development and testing environments to reverse...
PAKDD
2005
ACM
14 years 3 months ago
2005
ACM
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
DAGSTUHL
2008
13 years 11 months ago
2008
Existing selfverifying solvers for dense linear (interval-)systems in C-XSC provide high accuracy, but are rather slow. A new set of solvers is presented, which are a lot faster th...