11784 search results - page 607 / 2357 » Interpolation for data structures |
177
click to vote
PDCAT
2005
Springer
16 years 20 days ago
2005
Springer
This paper describes how to solve very large TravelingSalesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of para...
185
click to vote
VSTTE
2005
Springer
16 years 20 days ago
2005
Springer
After some general remarks about program verification, we introduce separation logic, a novel extension of Hoare logic that can strengthen the applicability and scalability of pro...
195
click to vote
ISAAC
2004
Springer
16 years 16 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...
178
click to vote
CLUSTER
2003
IEEE
16 years 14 days ago
2003
IEEE
Extendible hashing is a kind of fast indexing technology; it provides with a way of storing structural data records so that each of them can be gotten very quickly. In this paper,...
184
click to vote
ECSQARU
2003
Springer
16 years 12 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...