11394 search results - page 528 / 2279 » Error-Correcting Data Structures |
206
click to vote
JSAI
2007
Springer
16 years 1 months ago
2007
Springer
We model semantic interpretation operationally: constituents interact as their combination in discourse evolves from state to state. The states are recursive data structures and ev...
174
Voted
PDCAT
2005
Springer
16 years 16 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...
183
click to vote
VSTTE
2005
Springer
16 years 16 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...
193
Voted
ISAAC
2004
Springer
16 years 12 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...
170
click to vote
CLUSTER
2003
IEEE
16 years 10 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,...