1127 search results - page 13 / 226 » Testing the Expansion of a Graph |
DAM
2007
13 years 11 months ago
2007
In this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...
CIKM
2007
Springer
14 years 5 months ago
2007
Springer
Dictionary-based approaches to query translation have been widely used in Cross-Language Information Retrieval (CLIR) experiments. Using these approaches, translation has been not...
CVPR
2008
IEEE
15 years 28 days ago
2008
IEEE
Because of the large variation across different environments, a generic classifier trained on extensive data-sets may perform sub-optimally in a particular test environment. In th...
DEXA
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. In this paper we study the performance of linguisticallymotivated conflation techniques for Information Retrieval in Spanish. In particular, we have studied the applicat...
ESA
2010
Springer
14 years 15 hour ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...