8917 search results - page 431 / 1784 » Abstraction in Algorithm Animation |
191
click to vote
ICOIN
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
200
click to vote
LOPSTR
2004
Springer
16 years 4 days ago
2004
Springer
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
168
click to vote
ISAAC
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
166
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract— We present an incremental algorithm to estimate the penetration depth between convex polytopes in 3D. The algorithm incrementally seeks a “locally optimal solution”...
169
click to vote
IDA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We present a new algorithm for approximate joint diagonalization of several symmetric matrices. While it is based on the classical least squares criterion, a novel intrin...