Sciweavers

785 search results - page 120 / 157
» Binary Join Trees
Sort
View
VL
1999
IEEE
109views Visual Languages» more  VL 1999»
15 years 2 months ago
Constraint-Based Diagram Beautification
Recently a new metaphor for diagramming, the intelligent diagram has emerged. This new metaphor provides an excellent basis for diagram beautification since it automatically colle...
Sitt Sen Chok, Kim Marriott, Tom Paton
FC
2010
Springer
230views Cryptology» more  FC 2010»
15 years 1 months ago
Multiple Denominations in E-cash with Compact Transaction Data
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
Sébastien Canard, Aline Gouget
RTA
2010
Springer
15 years 1 months ago
Proving Productivity in Infinite Data Structures
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate a notion of productivity. This ...
Hans Zantema, Matthias Raffelsieper
FUN
2010
Springer
219views Algorithms» more  FUN 2010»
15 years 1 months ago
The Magic of a Number System
We introduce a new number system that supports increments with a constant number of digit changes. We also give a simple method that extends any number system supporting increments...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
DLOG
2007
15 years 1 days ago
On Ordering Descriptions in a Description Logic
We introduce a description language for specifying partial ordering relations over concept descriptions in description logics, and show how the language can be used in combination ...
Jeffrey Pound, Lubomir Stanchev, David Toman, Gran...