2340 search results - page 31 / 468 » Second quarter 2008 |
135
click to vote
VMV
2001
15 years 1 months ago
2001
Usually, the stereo correspondence for a feature point in the first image is obtained by searching in a predefined region of the second image, based on the epipolar line and the m...
109
click to vote
TREC
2003
15 years 1 months ago
2003
500,000 PubMed abstracts. However, less than 50 documents are relevant for most queries. Applying scoring to all 500,000 abstracts would create a lot of noise. In the first step, ...
102
click to vote
TREC
2003
15 years 1 months ago
2003
In our entry to the new HARD track, we have investigated two methods of interactively refining user search formulations. One method consists of asking the user to select a number ...
COLING
1996
15 years 1 months ago
1996
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
COLING
1994
15 years 1 months ago
1994
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...