Sciweavers

1675 search results - page 36 / 335
» Implementing Data Cubes Efficiently
Sort
View
JFP
2006
113views more  JFP 2006»
13 years 9 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
ICDE
2006
IEEE
161views Database» more  ICDE 2006»
14 years 11 months ago
A Primitive Operator for Similarity Joins in Data Cleaning
Data cleaning based on similarities involves identification of "close" tuples, where closeness is evaluated using a variety of similarity functions chosen to suit the do...
Surajit Chaudhuri, Venkatesh Ganti, Raghav Kaushik
ISMIS
2009
Springer
14 years 4 months ago
Discovering Relevant Cross-Graph Cliques in Dynamic Networks
Abstract. Several algorithms, namely CubeMiner, Trias, and DataPeeler, have been recently proposed to mine closed patterns in ternary relations. We consider here the specific cont...
Loïc Cerf, Tran Bao Nhan Nguyen, Jean-Fran&cc...
C++
1994
128views more  C++ 1994»
13 years 11 months ago
Implementing Signatures for C++
ne the design and detail the implementation of a language extension for abstracting types and for decoupling subtyping and inheritance in C++. This extension gives the user more of...
Gerald Baumgartner, Vincent F. Russo
CHES
2004
Springer
106views Cryptology» more  CHES 2004»
14 years 1 months ago
XTR Implementation on Reconfigurable Hardware
Abstract. Recently, Lenstra and Verheul proposed an efficient cryptosystem called XTR. This system represents elements of F p6 with order dividing p2 -p+1 by their trace over Fp2 ....
Eric Peeters, Michael Neve, Mathieu Ciet