Sciweavers

2656 search results - page 368 / 532
» Compacting XML Data
Sort
View
PLDI
1999
ACM
15 years 7 months ago
Whole Program Paths
Whole program paths (WPP) are a new approach to capturing and representing a program’s dynamic—actually executed—control flow. Unlike other path profiling techniques, which ...
James R. Larus
IPPS
1998
IEEE
15 years 7 months ago
A Scalable VLSI Architecture for Binary Prefix Sums
The task of computingbinary prefix sums (BPS, for short) arises, for example, in expression evaluation, data and storage compaction, and routing. This paper describes a scalable V...
Rong Lin, Koji Nakano, Stephan Olariu, Maria Crist...
PKC
1998
Springer
158views Cryptology» more  PKC 1998»
15 years 7 months ago
A Cellular Automaton Based Fast One-Way Hash Function Suitable for Hardware Implementation
One-way hash functions are an important tool in achieving authentication and data integrity. The aim of this paper is to propose a novel one-way hash function based on cellular aut...
Miodrag J. Mihaljevic, Yuliang Zheng, Hideki Imai
SSPR
1998
Springer
15 years 7 months ago
Multi-interval Discretization Methods for Decision Tree Learning
Properly addressing the discretization process of continuos valued features is an important problem during decision tree learning. This paper describes four multi-interval discreti...
Petra Perner, Sascha Trautzsch
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 7 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...