1568 search results - page 278 / 314 » The problem of examination questions in algorithmics |
133
Voted
CLEF
2010
Springer
15 years 5 months ago
2010
Springer
This paper describes the robot vision track that has been proposed to the ImageCLEF 2010 participants. The track addressed the problem of visual place classification, with a specia...
115
click to vote
IJFCS
2007
15 years 3 months ago
2007
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
197
click to vote
CORR
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
138
Voted
BIBE
2006
IEEE
15 years 10 months ago
2006
IEEE
An interesting and important, but largely ignored question associated with the ML method is whether there exists only a single maximum likelihood point for a given phylogenetic tr...
251
Voted
LCC
1994
15 years 8 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...