Sciweavers

821 search results - page 34 / 165
» Addressing the Petersen graph
Sort
View
ER
1993
Springer
163views Database» more  ER 1993»
15 years 3 months ago
Using Conceptual Graph Theory to Support Schema Integration
Two major problems in schema integration are to identify correspondences between different conceptual schemas and to verify that the proposed correspondences are consistent with th...
Paul Johannesson
ECIR
2008
Springer
15 years 1 months ago
Use of Implicit Graph for Recommending Relevant Videos: A Simulated Evaluation
In this paper, we propose a model for exploiting community based usage information for video retrieval. Implicit usage information from a pool of past users could be a valuable sou...
David Vallet, Frank Hopfgartner, Joemon M. Jose
CORR
2010
Springer
101views Education» more  CORR 2010»
14 years 12 months ago
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
Iryna Andriyanova, Jean-Pierre Tillich
CORR
2006
Springer
127views Education» more  CORR 2006»
14 years 11 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
15 years 3 months ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...