2553 search results - page 436 / 511 » Modeling Trees with Hypertextures |
172
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
199
click to vote
AC
2000
Springer
15 years 10 months ago
2000
Springer
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
166
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
144
click to vote
IPPS
1996
IEEE
15 years 10 months ago
1996
IEEE
In this paper, we study on the EREW-PRAM model a parallel solution to the extended set union problem with unlimited backtracking which maintains a dynamic partition of an n-elemen...
170
click to vote
RTSS
1992
IEEE
15 years 10 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...