Results 1  10
of
1,806
Text Chunking using TransformationBased Learning
, 1995
"... Eric Brill introduced transformationbased learning and showed that it can do partofspeech tagging with fairly high accuracy. The same method can be applied at a higher level of textual interpretation for locating chunks in the tagged text, including nonrecursive "baseNP" chunks. For ..."
Abstract

Cited by 523 (0 self)
 Add to MetaCart
. For this purpose, it is convenient to view chunking as a tagging problem by encoding the chunk structure in new tags attached to each word. In automatic tests using Treebankderived data, this technique achieved recall and precision rates of roughly 92% for baseNP chunks and 88% for somewhat more complex chunks
A Separator Theorem for Planar Graphs
, 1977
"... Let G be any nvertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which ..."
Abstract

Cited by 461 (1 self)
 Add to MetaCart
Let G be any nvertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains more than 2n/3 vertices, and C contains no more than 2& & vertices. We exhibit an algorithm which
Property Testing and its connection to Learning and Approximation
"... We study the question of determining whether an unknown function has a particular property or is fflfar from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract

Cited by 475 (67 self)
 Add to MetaCart
w.r.t the vertex set). Our graph property testing algorithms are probabilistic and make assertions which are correct with high probability, utilizing only poly(1=ffl) edgequeries into the graph, where ffl is the distance parameter. Moreover, the property testing algorithms can be used
Estimation and prediction for stochastic blockstructures.
 Journal of the American Statistical Association
, 2001
"... A statistical approach to a posteriori blockmodeling for digraphs and valued digraphs is proposed. The probability model assumes that the vertices of the digraph are partitioned into several unobserved (latent) classes and that the probability distribution of the relation between two vertices depen ..."
Abstract

Cited by 231 (5 self)
 Add to MetaCart
A statistical approach to a posteriori blockmodeling for digraphs and valued digraphs is proposed. The probability model assumes that the vertices of the digraph are partitioned into several unobserved (latent) classes and that the probability distribution of the relation between two vertices
Ordered Vertex Partitioning
, 2000
"... A transitive orientation of a graph is an orientation of the edges that produces a transitive digraph. The modulardecomposition of a graph is a canonical representation of all of its modules. Finding a transitive orientation and finding the modular decomposition are in some sense dual problems. In t ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
A transitive orientation of a graph is an orientation of the edges that produces a transitive digraph. The modulardecomposition of a graph is a canonical representation of all of its modules. Finding a transitive orientation and finding the modular decomposition are in some sense dual problems. In this paper, we describe a simple O(n+mlogn)algorithm that uses this duality to find both a transitive orientation and the modular decomposition. Though the running time is not optimal, this algorithm is much simpler than any previous algorithms that are not Ω(n²). The bestknown time bounds for the problems are O(n + m), but they involve sophisticated techniques.
Algorithms For Vertex Partitioning Problems On Partial kTrees
, 1997
"... In this paper, we consider a large class of vertex partitioning problems and apply to those the theory of algorithm design for problems restricted to partial ktrees. We carefully describe the details of algorithms and analyze their complexity in an attempt to make the algorithms feasible as solutio ..."
Abstract

Cited by 59 (6 self)
 Add to MetaCart
In this paper, we consider a large class of vertex partitioning problems and apply to those the theory of algorithm design for problems restricted to partial ktrees. We carefully describe the details of algorithms and analyze their complexity in an attempt to make the algorithms feasible
Canonical vertex partitions
"... Let σ be a finite relational signature and T a set of finite complete relational structures of signature σ and HT the countable homogeneous relational structure of signature σ which does not embed any of the structures in T. In the case that σ consists of at most binary relations and T is finite the ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
the vertex partition behaviour of HT is completely analysed; in the sense that it is shown that a canonical partition exists and the size of this partition in terms of the structures in T is determined. If T is infinite some results are obtained but a complete analysis is still missing. Some general results
Vertex partitions of chordal graphs
 J. Graph Theory
"... Abstract. A ktree is a chordal graph with no (k + 2)clique. An ℓtreepartition of a graph G is a vertex partition of G into ‘bags’, such that contracting each bag to a single vertex gives an ℓtree (after deleting loops and replacing parallel edges by a single edge). We prove that for all k ≥ ℓ ≥ ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. A ktree is a chordal graph with no (k + 2)clique. An ℓtreepartition of a graph G is a vertex partition of G into ‘bags’, such that contracting each bag to a single vertex gives an ℓtree (after deleting loops and replacing parallel edges by a single edge). We prove that for all k ≥ ℓ
Degreebounded vertex partitions
, 2008
"... This paper studies degreebounded vertex partitions, derives analogues for wellknown results on the chromatic number and graph perfection, and presents two algorithms for constructing degreebounded vertex partitions. The first algorithm minimizes the number of partition classes. The second algorit ..."
Abstract
 Add to MetaCart
This paper studies degreebounded vertex partitions, derives analogues for wellknown results on the chromatic number and graph perfection, and presents two algorithms for constructing degreebounded vertex partitions. The first algorithm minimizes the number of partition classes. The second
Results 1  10
of
1,806