69 search results - page 5 / 14 » Merkle Tree Traversal in Log Space and Time |
89
Voted
JDA
2007
15 years 21 days ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
115
Voted
GRAPHICSINTERFACE
1997
15 years 2 months ago
1997
We present a system for incorporating multiple level of detail (LOD) models of 3D objects within a single hierarchical data structure. This system was designed for a scientific vi...
114
click to vote
GD
1998
Springer
15 years 5 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
111
Voted
CEC
2008
IEEE
15 years 2 months ago
2008
IEEE
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
123
click to vote
SODA
1990
ACM
15 years 1 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...