Sciweavers

3268 search results - page 301 / 654
» The hub number of a graph
Sort
View
ACL
2006
15 years 8 months ago
Unsupervised Relation Disambiguation Using Spectral Clustering
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...
Jinxiu Chen, Dong-Hong Ji, Chew Lim Tan, Zheng-Yu ...
DM
2008
79views more  DM 2008»
15 years 6 months ago
The reconstruction conjecture and edge ideals
Given a simple graph G on n vertices, we prove that it is possible to reconstruct several algebraic properties of the edge ideal from the deck of G, that is, from the collection o...
Kia Dalili, Sara Faridi, Will Traves
COMBINATORICS
2006
112views more  COMBINATORICS 2006»
15 years 6 months ago
More Forbidden Minors for Wye-Delta-Wye Reducibility
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
Yaming Yu
COMBINATORICS
2006
155views more  COMBINATORICS 2006»
15 years 6 months ago
Orthogonal Art Galleries with Holes: A Coloring Proof of Aggarwal's Theorem
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...
Pawel Zylinski
CORR
2006
Springer
161views Education» more  CORR 2006»
15 years 6 months ago
Consensus Propagation
We propose consensus propagation, an asynchronous distributed protocol for averaging numbers across a network. We establish convergence, characterize the convergence rate for regul...
Ciamac Cyrus Moallemi, Benjamin Van Roy