Sciweavers

11211 search results - page 1794 / 2243
» Data Structures
Sort
View
CSMR
2004
IEEE
15 years 10 months ago
Source Code Modularization Using Lattice of Concept Slices
Most legacy systems have been altered due to prolonged maintenance to the point that they deviate significantly from their original and intended design and consequently, they lack...
Raihan Al-Ekram, Kostas Kontogiannis
DEXA
2004
Springer
159views Database» more  DEXA 2004»
15 years 10 months ago
Adaptive Double Routing Indices: Combining Effectiveness and Efficiency in P2P Systems
Unstructured peer-to-peer systems rely on strategies and data structures (Routing Indices) for the routing of requests in the network. For those requests corresponding to informati...
Stéphane Bressan, Achmad Nizar Hidayanto, C...
FLOPS
2004
Springer
15 years 10 months ago
LIX: an Effective Self-applicable Partial Evaluator for Prolog
This paper presents a self-applicable partial evaluator for a considerable subset of full Prolog. The partial evaluator is shown to achieve non-trivial specialisation and be effect...
Stephen-John Craig, Michael Leuschel
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
15 years 10 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
CSR
2006
Springer
15 years 10 months ago
All Semi-local Longest Common Subsequences in Subquadratic Time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
Alexandre Tiskin
« Prev « First page 1794 / 2243 Last » Next »