2210 search results - page 249 / 442 » CLEF 2001 - Overview of Results |
171
click to vote
WSC
2001
15 years 8 months ago
2001
This paper describes a novel method for detecting the bottleneck in a discrete event system by examining the average duration of a machine being active for all machines. The machi...
174
click to vote
DM
2008
15 years 6 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
167
click to vote
DM
2008
15 years 6 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
140
click to vote
EJC
2007
15 years 6 months ago
2007
3 We define four families of geometries with as point graph the graph — or its complement — of all elliptic 4 hyperplanes of a given parabolic quadric in any finite 6-dimensi...
164
click to vote
COLING
2002
15 years 6 months ago
2002
With the rapid growth of real world applications for NLP systems, there is a genuine demand for a general toolkit from which programmers with no linguistic knowledge can build spe...