Sciweavers

157 search results - page 18 / 32
» On indexing error-tolerant set containment
Sort
View
PVLDB
2008
108views more  PVLDB 2008»
13 years 7 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
AMKM
2003
Springer
14 years 29 days ago
A Spreading Activation Framework for Ontology-Enhanced Adaptive Information Access within Organisations
This research investigates a unique Indexing Structure and Navigational Interface which integrates (1) ontology-driven knowledge-base (2) statistically derived indexing parameters...
Md Maruf Hasan
JCT
2011
115views more  JCT 2011»
13 years 2 months ago
Sharp thresholds for hypergraph regressive Ramsey numbers
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...
Lorenzo Carlucci, Gyesik Lee, Andreas Weiermann
EDBT
2008
ACM
120views Database» more  EDBT 2008»
14 years 7 months ago
Flint: Google-basing the Web
Several Web sites deliver a large number of pages, each publishing data about one instance of some real world entity, such as an athlete, a stock quote, a book. Even though it is ...
Lorenzo Blanco, Valter Crescenzi, Paolo Merialdo, ...
IWPC
1999
IEEE
14 years 9 hour ago
Recovery of Jump Table Case Statements from Binary Code
One of the fundamental problems with the static analysis of binary (executable) code is that7 of recognizing, in a machine-independent way, the target addresses of n-conditional b...
Cristina Cifuentes, Mike Van Emmerik