4212 search results - page 50 / 843 » On Compressible Pairings and Their Computation |
152
click to vote
ICDM
2006
IEEE
16 years 6 days ago
2006
IEEE
Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation...
165
click to vote
RTA
2009
Springer
16 years 21 days ago
2009
Springer
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
127
click to vote
GROUP
2005
ACM
15 years 11 months ago
2005
ACM
Although pair programming is becoming more prevalent in software development, and a number of reports have been written about it [4] [6], few have addressed the manner in which pa...
176
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
A 4-phase Golay sequence pair of length s ≡ 5 (mod 8) is constructed from a Barker sequence of the same length whose even-indexed elements are prescribed. This explains the orig...
148
click to vote
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
We introduce a software/hardware scheme called the Field Array Compression Technique (FACT) which reduces cache misses due to recursive data structures. Using a data layout transfo...