6249 search results - page 1043 / 1250 » Topological Informational Spaces |
184
click to vote
PDCAT
2007
Springer
16 years 1 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
174
click to vote
SPIRE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
172
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
219
click to vote
WEA
2007
Springer
16 years 1 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
184
click to vote
AICCSA
2006
IEEE
16 years 1 months ago
2006
IEEE
Although E-learning has advanced considerably in the last decade, some of its aspects, such as E-testing, are still in the development phase. Authoring tools and test banks for E-...