Sciweavers

1512 search results - page 25 / 303
» connection 2006
Sort
View
PAMI
2010
133views more  PAMI 2010»
14 years 7 months ago
An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation
— Word sense disambiguation (WSD), the task of identifying the intended meanings (senses) of words in context, has been a long-standing research objective for natural language pr...
Roberto Navigli, Mirella Lapata
94
Voted
ESA
2006
Springer
112views Algorithms» more  ESA 2006»
15 years 1 months ago
Enumerating Spanning and Connected Subsets in Graphs and Matroids
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...
FUIN
2006
67views more  FUIN 2006»
14 years 9 months ago
On minimal models of the Region Connection Calculus
Abstract. Region Connection Calculus (RCC) is one primary formalism of qualitative spatial reasoning. Standard RCC models are continuous ones where each region is infinitely divisi...
Lirong Xia, Sanjiang Li
IJWBC
2006
111views more  IJWBC 2006»
14 years 9 months ago
SIOC: an approach to connect web-based communities
: Online communities are islands of people and topics that are not interlinked. Complementary discussions exist on disparate systems but it is currently difficult to exploit the av...
John G. Breslin, Stefan Decker, Andreas Harth, Uld...
JDA
2006
83views more  JDA 2006»
14 years 9 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki