4541 search results - page 330 / 909 » Cache-Oblivious Algorithms and Data Structures |
159
click to vote
BMCBI
2011
14 years 7 months ago
2011
Background: In 2004, we presented a web resource for stimulating the search for novel RNAs, RNA-As-Graphs (RAG), which classified, catalogued, and predicted RNA secondary structur...
151
click to vote
PPOPP
2012
ACM
13 years 11 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
145
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
149
click to vote
EUSFLAT
2009
2009
Ant Colony Optimization for Distributed Routing Path Optimization in Optical Burst-Switched Networks
15 years 1 months ago
This work describes a distributed framework for routing path optimization in Optical Burst-Switched (OBS) networks that loosely mimics the foraging behaviour of ants observed in na...
116
Voted
SIGCSE
2000
ACM
15 years 8 months ago
2000
ACM
We propose an object-oriented (OO) formulation and implementation of lazy/delayed evaluation by reusing and extending an existing linear recursive structure (LRS) framework with t...