4013 search results - page 215 / 803 » computer 2002 |
147
click to vote
COLING
2002
15 years 4 months ago
2002
The paper examines different possibilities to take advantage of the taxonomic organization of a thesaurus to improve the accuracy of classifying new words into its classes. The re...
136
click to vote
TCS
2002
15 years 4 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
116
click to vote
TCS
2002
15 years 4 months ago
2002
A real is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals. A real is random if its binary expansion is a random sequence. Ou...
118
click to vote
ICPR
2002
IEEE
15 years 9 months ago
2002
IEEE
A motion estimation algorithm for log-polar images, based on a previous general framework [2], is presented. The advantages and disadvantages brought by the use of this kind of fo...
140
click to vote
PRL
2006
15 years 4 months ago
2006
A simple and fast method of determining the position of the optical center without any specialized equipment is presented. The position of the optical center is a depth determinin...