11211 search results - page 425 / 2243 » Data Structures |
185
click to vote
ISAAC
2004
Springer
16 years 6 days ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
172
click to vote
ECSQARU
2003
Springer
16 years 2 days ago
2003
Springer
An overview is provided of recent developments in the use of latent class (LC) models in social science research. Special attention is paid to the application of LC analysis as a f...
160
click to vote
ESA
2003
Springer
16 years 1 days ago
2003
Springer
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
156
click to vote
SIGCSE
1999
ACM
15 years 11 months ago
1999
ACM
This paper describes a project suitable for students in CS2 that combines the classical implementation of basic data structures (priority queues, lists, arrays) with the design an...
161
click to vote
CAV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. This paper presents a practical automatic verification procedure for proving linearizability (i.e., atomicity and functional correctness) of concurrent data structure im...