Sciweavers

1221 search results - page 127 / 245
» Balanced graph partitioning
Sort
View
EMNLP
2006
13 years 11 months ago
Learning Field Compatibilities to Extract Database Records from Unstructured Text
Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper ...
Michael L. Wick, Aron Culotta, Andrew McCallum
FLAIRS
2008
14 years 14 days ago
Paraphrase Identification with Lexico-Syntactic Graph Subsumption
The paper presents a new approach to the problem of paraphrase identification. The new approach extends a previously proposed method for the task of textual entailment. The relati...
Vasile Rus, Philip M. McCarthy, Mihai C. Lintean, ...
DAM
2010
137views more  DAM 2010»
13 years 10 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
JCT
2000
78views more  JCT 2000»
13 years 10 months ago
Discrete Green's Functions
We study discrete Green's functions and their relationship with discrete Laplace equations. Several methods for deriving Green's functions are discussed. Green's fu...
Fan R. K. Chung, S.-T. Yau
CIVR
2005
Springer
133views Image Analysis» more  CIVR 2005»
14 years 3 months ago
Hot Event Detection and Summarization by Graph Modeling and Matching
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
Yuxin Peng, Chong-Wah Ngo