19 search results - page 3 / 4 » Kernelized Sorting |
IEEEPACT
1999
IEEE
13 years 9 months ago
1999
IEEE
Existing techniques can enhance the locality of arrays indexed by affine functions of induction variables. This paper presents a technique to localize non-affine array references,...
SIGMETRICS
2004
ACM
13 years 10 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
SAS
2009
Springer
14 years 5 months ago
2009
Springer
ion Refinement for Quantified Array Assertions Mohamed Nassim Seghir1, , Andreas Podelski1 , and Thomas Wies1,2 1 University of Freiburg, Germany 2 EPFL, Switzerland Abstract. We p...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
Researchers and practitioners in the area of parallel and distributed computing have been lacking a portable, flexible and robust distributed instrumentation system. We present th...
JMLR
2008
13 years 4 months ago
2008
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...