8825 search results - page 57 / 1765 » All for one or one for all |
COMBINATORICS
2006
13 years 7 months ago
2006
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
CLEF
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. This paper describes the participation of Dublin City University in the CriES (Cross-Lingual Expert Search) pilot challenge. To realize expert search, we combine traditio...
ISCAS
2005
IEEE
14 years 1 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
AI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The purpose of this paper is to test the hypothesis that simple classifiers are more robust to changing environments than complex ones. We propose a strategy for generati...
ERCIMDL
2008
Springer
13 years 9 months ago
2008
Springer
A lexical signature (LS) is a small set of terms derived from a document that capture the "aboutness" of that document. A LS generated from a web page can be used to disc...