Sciweavers

1395 search results - page 141 / 279
» Modeling betweenness for question answering
Sort
View
LREC
2008
216views Education» more  LREC 2008»
15 years 6 months ago
Towards Semi Automatic Construction of a Lexical Ontology for Persian
Lexical ontologies and semantic lexicons are important resources in natural language processing. They are used in various tasks and applications, especially where semantic process...
Mehrnoush Shamsfard
ARSCOM
2008
192views more  ARSCOM 2008»
15 years 4 months ago
Bounds on the metric and partition dimensions of a graph
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
Glenn G. Chappell, John G. Gimbel, Chris Hartman
GC
2008
Springer
15 years 4 months ago
Almost Given Length Cycles in Digraphs
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
Raphael Yuster
JILP
2000
103views more  JILP 2000»
15 years 4 months ago
Comparing and Combining Profiles
How much do two profiles of the same program differ? When has a profile changed enough to warrant reexamination of the profiled program? And how should two or more profiles be com...
Serap A. Savari, Cliff Young
AAAI
2011
14 years 4 months ago
Cross-Language Latent Relational Search: Mapping Knowledge across Languages
Latent relational search (LRS) is a novel approach for mapping knowledge across two domains. Given a source domain knowledge concerning the Moon, “The Moon is a satellite of the...
Nguyen Tuan Duc, Danushka Bollegala, Mitsuru Ishiz...