Sciweavers

4212 search results - page 50 / 843
» On Compressible Pairings and Their Computation
Sort
View
95
Voted
ICDM
2006
IEEE
95views Data Mining» more  ICDM 2006»
15 years 6 months ago
TOP-COP: Mining TOP-K Strongly Correlated Pairs in Large Databases
Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation...
Hui Xiong, Mark Brodie, Sheng Ma
96
Voted
RTA
2009
Springer
15 years 7 months ago
The Derivational Complexity Induced by the Dependency Pair Method
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...
Georg Moser, Andreas Schnabl
69
Voted
GROUP
2005
ACM
15 years 6 months ago
Pair programming and the re-appropriation of individual tools for collaborative programming
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...
Sallyann Bryant, Pablo Romero, Benedict du Boulay
119
Voted
DCC
2011
IEEE
14 years 7 months ago
Quaternary Golay sequence pairs II: odd length
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...
Richard G. Gibson, Jonathan Jedwab
EUROPAR
2003
Springer
15 years 5 months ago
Compression in Data Caches with Compressible Field Isolation for Recursive Data Structures
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...
Masamichi Takagi, Kei Hiraki