Results 1  10
of
433,818
Finding the Most Relevant Fragments in Networks
, 2009
"... We study a point pattern detection problem on networks, motivated by applications in geographical analysis, such as crime hotspot detection. Given a network N (a connected graph with nonnegative edge lengths) together with a set of sites, which lie on the edges or vertices of N, we look for a conne ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study a point pattern detection problem on networks, motivated by applications in geographical analysis, such as crime hotspot detection. Given a network N (a connected graph with nonnegative edge lengths) together with a set of sites, which lie on the edges or vertices of N, we look for a connected subnetwork F of N of small total length that contains many sites. The edges of F can form parts of the edges of N. We consider different variants of this problem where N is either a general graph or restricted to a tree, and the subnetwork F that we are looking for is either a simple path, a path with selfintersections at vertices, or a tree. We give polynomialtime algorithms, NPhardness and NPcompleteness proofs, approximation algorithms, and also fixedparameter tractable algorithms. 1
Identifying Relevant Fragments of Learner Profile on the Semantic Web
, 2004
"... The aim of this paper is to discuss how to identify distributed learner profile fragments on the semantic web. The learner profile fragments are modelled employing vocabulary suggested by several standards for learner profile. The learner profile fragments are maintained as standalone semantic ..."
Abstract
 Add to MetaCart
The aim of this paper is to discuss how to identify distributed learner profile fragments on the semantic web. The learner profile fragments are modelled employing vocabulary suggested by several standards for learner profile. The learner profile fragments are maintained as standalone semantic
Finding the most relevant fragments in networks Citation for published version (APA): Finding the Most Relevant Fragments in Networks
, 2010
"... Abstract We study a point pattern detection problem on networks, motivated by applications in geographical analysis, such as crime hotspot detection. Given a network N (a connected graph with nonnegative edge lengths) together with a set of sites, which lie on the edges or vertices of N , we look ..."
Abstract
 Add to MetaCart
Abstract We study a point pattern detection problem on networks, motivated by applications in geographical analysis, such as crime hotspot detection. Given a network N (a connected graph with nonnegative edge lengths) together with a set of sites, which lie on the edges or vertices of N , we look for a connected subnetwork F of N of small total length that contains many sites. The edges of F can form parts of the edges of N . We consider different variants of this problem where N is either a general graph or restricted to a tree, and the subnetwork F that we are looking for is either a simple path or a tree. We give polynomialtime algorithms, NPhardness and NPcompleteness proofs, approximation algorithms, and also fixedparameter tractable algorithms.
The pascal recognising textual entailment challenge
 In Proceedings of the PASCAL Challenges Workshop on Recognising Textual Entailment
, 2005
"... This paper describes the PASCAL Network of Excellence Recognising Textual Entailment (RTE) Challenge benchmark 1. The RTE task is defined as recognizing, given two text fragments, whether the meaning of one text can be inferred (entailed) from the other. This applicationindependent task is suggested ..."
Abstract

Cited by 380 (21 self)
 Add to MetaCart
This paper describes the PASCAL Network of Excellence Recognising Textual Entailment (RTE) Challenge benchmark 1. The RTE task is defined as recognizing, given two text fragments, whether the meaning of one text can be inferred (entailed) from the other. This applicationindependent task
Modal Languages And Bounded Fragments Of Predicate Logic
, 1996
"... Model Theory. These are nonempty families I of partial isomorphisms between models M and N , closed under taking restrictions to smaller domains, and satisfying the usual BackandForth properties for extension with objects on either side  restricted to apply only to partial isomorphisms of size ..."
Abstract

Cited by 272 (12 self)
 Add to MetaCart
. Quantified variables are irrelevant to the assignment, so that the relevant partial isomorphism can be res...
Mining molecular fragments: Finding relevant substructures of molecules
 Proc. of the ICDM
, 2002
"... ..."
Fragmentation
, 2011
"... trees for the structur ob,2 he en tat ho in t ef ra the in ltis nt in order to yield a robust metabolite identification platform. achieved used liquid chromatography (LC) or capillary electro ..."
Abstract
 Add to MetaCart
trees for the structur ob,2 he en tat ho in t ef ra the in ltis nt in order to yield a robust metabolite identification platform. achieved used liquid chromatography (LC) or capillary electro
Fragmented
, 2012
"... systems for collective action Can the institutional architecture in East Asia carry the challenge of climate change? ..."
Abstract
 Add to MetaCart
systems for collective action Can the institutional architecture in East Asia carry the challenge of climate change?
Results 1  10
of
433,818