Sciweavers

11214 search results - page 2008 / 2243
» Just-in-time data structures
Sort
View
CSL
2006
Springer
15 years 3 months ago
Separation Logic for Higher-Order Store
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...
Bernhard Reus, Jan Schwinghammer
CSR
2006
Springer
15 years 3 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
DEXA
2006
Springer
193views Database» more  DEXA 2006»
15 years 3 months ago
Understanding and Enhancing the Folding-In Method in Latent Semantic Indexing
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
Xiang Wang 0002, Xiaoming Jin
DGCI
2006
Springer
15 years 3 months ago
A Network Flow Algorithm for Binary Image Reconstruction from Few Projections
Tomography deals with the reconstruction of images from their projections. In this paper we focus on tomographic reconstruction of binary images (i.e., black-and-white) that do not...
Kees Joost Batenburg
EKAW
2006
Springer
15 years 3 months ago
Matching Unstructured Vocabularies Using a Background Ontology
Existing ontology matching algorithms use a combination of lexical and structural correspondance between source and target ontologies. We present a realistic case-study where both ...
Zharko Aleksovski, Michel C. A. Klein, Warner ten ...
« Prev « First page 2008 / 2243 Last » Next »