Sciweavers

11214 search results - page 5 / 2243
» Just-in-time data structures
Sort
View
SIAMCOMP
2012
12 years 6 days ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
SIGCSE
2002
ACM
149views Education» more  SIGCSE 2002»
13 years 9 months ago
A comprehensive project for CS2: combining key data structures and algorithms into an integrated web browser and search engine
We present our experience using a large, real-world application as a course project for the second half of the semester of a CS2 course. Our primary goal for the project was to cr...
Tia Newhall, Lisa Meeden
TCS
2002
13 years 9 months ago
Augmenting the discrete timed automaton with other data structures
We describe a general automata-theoretic approach for analyzing the veri
Oscar H. Ibarra, Jianwen Su
DAM
2010
104views more  DAM 2010»
13 years 8 months ago
Sorting with networks of data structures
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
Therese C. Biedl, Alexander Golynski, Angèl...
TGIS
2010
86views more  TGIS 2010»
13 years 4 months ago
A Road Network Selection Process Based on Data Enrichment and Structure Detection
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...
Guillaume Touya