Sciweavers

4305 search results - page 356 / 861
» The Test of Time
Sort
View
DAWAK
2000
Springer
15 years 11 months ago
Mining Frequent Binary Expressions
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
Toon Calders, Jan Paredaens
ARVLSI
1999
IEEE
94views VLSI» more  ARVLSI 1999»
15 years 11 months ago
Optimal Clocking and Enhanced Testability for High-Performance Self-Resetting Domino Pipelines
We describe a method to clock the domino pipeline at the maximum rate by using soft synchronizers between pipeline stages and thus allowing "time borrowing," i.e., allow...
Ayoob E. Dooply, Kenneth Y. Yun
ASIACRYPT
1999
Springer
15 years 11 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan
IV
1999
IEEE
115views Visualization» more  IV 1999»
15 years 11 months ago
Interaction with the Reorderable Matrix
The Reorderable Matrix is a simple visualization method for quantitative tabular data. This paper examines how first-time users interact with the Reorderable Matrix and how well t...
Harri Siirtola
ESA
1999
Springer
89views Algorithms» more  ESA 1999»
15 years 11 months ago
On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees
Abstract. This paper addresses the informational asymmetry for constructing an ultrametric evolutionary tree from upper and lower bounds on pairwise distances between n given speci...
Ting Chen, Ming-Yang Kao