2498 search results - page 272 / 500 » Data Structures with Unpredictable Timing |
178
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
156
click to vote
ISMIR
2001
Springer
15 years 11 months ago
2001
Springer
The focus of this paper is on the design and use of a music score representation. The structure of the representation is discussed and illustrated with sample algorithms, includin...
183
click to vote
GW
1999
Springer
15 years 10 months ago
1999
Springer
Led by the fundamental role that rhythms apparently play in speech and gestural communication among humans, this study was undertaken to substantiate a biologically motivated model...
165
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
186
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...