1297 search results - page 7 / 260 » fews 2007 |
116
Voted
TRECVID
2007
15 years 27 days ago
2007
This paper describes our experiments for the high level feature extraction task in TRECVid 2007. We submitted the following five runs: • A jr1 1: Baseline run using early fusio...
MICRO
2007
IEEE
15 years 6 months ago
2007
IEEE
The performance of computer systems varies over the course of their execution. A system may perform well during some parts of its execution and poorly during others. To understand...
107
click to vote
SIGIR
2008
ACM
14 years 11 months ago
2008
ACM
We address a specific enterprise document search scenario, where the information need is expressed in an elaborate manner. In our scenario, information needs are expressed using a...
ENDM
2007
14 years 11 months ago
2007
We survey recent results on a few distance labelling problems for hypercubes and Hamming graphs.
ARSCOM
1999
14 years 11 months ago
1999
For a given graph G, we fix s, and partition the vertex set into s classes, so that any given class contains few edges. The result gives a partition (U1,