Sciweavers

175 search results - page 10 / 35
» max-cut and Containment Relations in Graphs
Sort
View
HICSS
2008
IEEE
121views Biometrics» more  HICSS 2008»
14 years 3 months ago
The Impact of Directionality in Predications on Text Mining
The number of publications in biomedicine is increasing enormously each year. To help researchers digest the information in these documents, text mining tools are being developed ...
Gondy Leroy, Marcelo Fiszman, Thomas C. Rindflesch
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 8 months ago
The overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
Bill Rosgen, Lorna Stewart
LREC
2010
199views Education» more  LREC 2010»
13 years 10 months ago
Building a Cross-lingual Relatedness Thesaurus using a Graph Similarity Measure
The Internet is an ever growing source of information stored in documents of different languages. Hence, cross-lingual resources are needed for more and more NLP applications. Thi...
Lukas Michelbacher, Florian Laws, Beate Dorow, Ulr...
ICCS
2007
Springer
13 years 10 months ago
Conceptual Graphs as Cooperative Formalism to Build and Validate a Domain Expertise
Abstract. This work takes place in the general context of the construction and validation of a domain expertise. It aims at the cooperation of two kinds of knowledge, heterogeneous...
Rallou Thomopoulos, Jean-François Baget, Ol...
JCT
2010
127views more  JCT 2010»
13 years 3 months ago
On the density of a graph and its blowup
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
Asaf Shapira, Raphael Yuster