Results 1  10
of
149,902
Embedding partial Steiner triple systems
 Proc. London Math. Soc
, 1980
"... We prove that a partial Steiner triple system 8 of order n can be embedded in a Steiner triple system T of any given admissible order greater than 4w. Furthermore, if G(S), the missingedge graph of S, has the property that A(G)<ri(n + l)l and \E(G)\ then # can be embedded in a Steiner triple sys ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We prove that a partial Steiner triple system 8 of order n can be embedded in a Steiner triple system T of any given admissible order greater than 4w. Furthermore, if G(S), the missingedge graph of S, has the property that A(G)<ri(n + l)l and \E(G)\ then # can be embedded in a Steiner triple
Index Structures for Path Expressions
, 1997
"... In recent years there has been an increased interest in managing data which does not conform to traditional data models, like the relational or object oriented model. The reasons for this nonconformance are diverse. One one hand, data may not conform to such models at the physical level: it may be ..."
Abstract

Cited by 326 (7 self)
 Add to MetaCart
be simply specified by a schema which is too complex or changes too often to be described easily as a traditional schema. The term semistructured data has been used to refer to such data. The data model proposed for this kind of data consists of an edgelabeled graph, in which nodes correspond to objects
Ancestral Graph Markov Models
, 2002
"... This paper introduces a class of graphical independence models that is closed under marginalization and conditioning but that contains all DAG independence models. This class of graphs, called maximal ancestral graphs, has two attractive features: there is at most one edge between each pair of verti ..."
Abstract

Cited by 119 (22 self)
 Add to MetaCart
This paper introduces a class of graphical independence models that is closed under marginalization and conditioning but that contains all DAG independence models. This class of graphs, called maximal ancestral graphs, has two attractive features: there is at most one edge between each pair
A Pattern Approach to Interaction Design
, 2000
"... To create successful interactive systems, user interface designers need to cooperate with developers and application domain experts in an interdisciplinary team. These groups, however, usually miss a common terminology to exchange ideas, opinions, and values. This paper presents an approach that use ..."
Abstract

Cited by 253 (13 self)
 Add to MetaCart
To create successful interactive systems, user interface designers need to cooperate with developers and application domain experts in an interdisciplinary team. These groups, however, usually miss a common terminology to exchange ideas, opinions, and values. This paper presents an approach
Learning missing edges via kernels in partiallyknown graphs
"... Abstract. This paper deals with the problem of learning unknown edges with attributes in a partiallygiven multigraph. The method is an extension of Maximum Margin MultiValued Regression (M3VM) to the case where those edges are characterized by different attributes. It is applied on a largescale p ..."
Abstract
 Add to MetaCart
Abstract. This paper deals with the problem of learning unknown edges with attributes in a partiallygiven multigraph. The method is an extension of Maximum Margin MultiValued Regression (M3VM) to the case where those edges are characterized by different attributes. It is applied on a large
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
"... While the social and information networks have become ubiquitous, the challenge ofcollecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer the uno ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
While the social and information networks have become ubiquitous, the challenge ofcollecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer
graphs?
"... inferences for building discourse structures. In his discussion of our paper, Marcu mentions several such constraints on building discourse structures. In Section 2, we will discuss each of these constraints in more detail. However, more generally, we would like to point out the difference between M ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
inferences for building discourse structures. In his discussion of our paper, Marcu mentions several such constraints on building discourse structures. In Section 2, we will discuss each of these constraints in more detail. However, more generally, we would like to point out the difference between Marcu’s and our discourse coherence research program. Marcu (2003)’s goal seems to be to first specify a set of constraints on possible discourse annotations, and then annotate texts with these constraints in mind. The underlying assumption seems to be that otherwise the coherence annotation process is too unconstrained, and that annotators would be unable to agree on a discourse structure for a text without such constraints. However, we believe that this assumption is not valid. Our initial assumption was that given a reasonable taxonomy of discourse coherence relations, annotators can agree on a discourse structure for a text. In support of our assumption, we have annotated 135 texts from the Wall Street Journal and the AP Newswire with two annotators per text; for the 135 texts, interannotator agreement was 88.45%, perchance agreement was 24.86%, and kappa was 84.63 % (Wolf et al. (submitted)). We believe that these agreement figures refute Marcu (2003)’s underlying assumption that without
Results 1  10
of
149,902