Sciweavers

191 search results - page 23 / 39
» Melding Priority Queues
Sort
View
SWAT
2004
Springer
146views Algorithms» more  SWAT 2004»
15 years 5 months ago
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
Gerth Stølting Brodal, Rolf Fagerberg, Ulri...
86
Voted
DAGM
1995
Springer
15 years 3 months ago
Primary Image Segmentation
: This paper introduces the notion of primary image segmentation which serves as a well defined link between low- and high-level image analysis. A general algorithmic framework bas...
Ullrich Köthe
114
Voted
FPL
1995
Springer
152views Hardware» more  FPL 1995»
15 years 3 months ago
Compiling Ruby into FPGAs
This paper presents an overview of a prototype hardware compiler which compiles a design expressed in the Ruby language into FPGAs. The features of two important modules, the re ne...
Shaori Guo, Wayne Luk
RSA
2006
144views more  RSA 2006»
15 years 8 days ago
Data structures with dynamical random transitions
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
Clément Dombry, Nadine Guillotin-Plantard, ...
CLUSTER
2008
IEEE
15 years 6 months ago
Empirical-based probabilistic upper bounds for urgent computing applications
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
Nick Trebon, Peter H. Beckman