Sciweavers

2498 search results - page 263 / 500
» Data Structures with Unpredictable Timing
Sort
View
FOCS
2005
IEEE
16 years 5 days ago
Towards a Final Analysis of Pairing Heaps
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
Seth Pettie
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
15 years 7 months ago
Suffix Arrays: A New Method for On-Line String Searches
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...
Udi Manber, Gene Myers
IEEECIT
2010
IEEE
15 years 5 months ago
Superblock-Based Source Code Optimizations for WCET Reduction
—Superblocks represent regions in a program code that consist of multiple basic blocks. Compilers benefit from this structure since it enables optimization across block boundari...
Paul Lokuciejewski, Timon Kelter, Peter Marwedel
BIODATAMINING
2008
120views more  BIODATAMINING 2008»
15 years 6 months ago
Filling the gap between biology and computer science
This editorial introduces BioData Mining, a new journal which publishes research articles related to advances in computational methods and techniques for the extraction of useful ...
Jesús S. Aguilar-Ruiz, Jason H. Moore, Mary...
ISBI
2004
IEEE
16 years 7 months ago
Automatic Quantification of Microtubule Dynamics
The dynamics of the microtubule assembly are very significant both for cell function and structure. Abnormal function of the assembly is involved in neurodegenerative diseases and...
Stathis Hadjidemetriou, James S. Duncan, Derek Too...