Sciweavers

3837 search results - page 577 / 768
» Learning Approximate Consistencies
Sort
View
CIKM
2006
Springer
15 years 10 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
DEXA
2006
Springer
193views Database» more  DEXA 2006»
15 years 10 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
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
15 years 10 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
15 years 10 months ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira
ACISICIS
2009
IEEE
15 years 9 months ago
A Parallel Algorithm for Computer Simulation of Electrocardiogram Based on MPI
—This paper presents a parallel algorithm for computer simulation of Electrocardiogram (ECG) based on a 3-dimensional (3D) whole-heart model. The computer heart model includes ap...
Wenfeng Shen, Weijia Lu, Daming Wei, Weimin Xu, Xi...