Sciweavers

11722 search results - page 195 / 2345
» How Developers Develop Features
Sort
View
MVA
2008
201views Computer Vision» more  MVA 2008»
15 years 2 months ago
How close are we to solving the problem of automated visual surveillance?
The problem of automated visual surveillance has spawned a lively research area, with 2005 seeing three conferences or workshops and special issues of two major journals devoted to...
Hannah M. Dee, Sergio A. Velastin
SYNTHESE
2008
84views more  SYNTHESE 2008»
15 years 2 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
117
Voted
IJMI
2002
82views more  IJMI 2002»
15 years 2 months ago
Protein names and how to find them
A prerequisite for all higher level information extraction tasks is the identication of unknown names in text. Today, when large corpora can consist of billions of words, it is of...
Kristofer Franzén, Gunnar Eriksson, Fredrik...
MICS
2008
87views more  MICS 2008»
15 years 2 months ago
Spurious Disambiguation Errors and How to Get Rid of Them
The disambiguation approach to the input of formulae enables users of mathematical assistants to type correct formulae in a terse syntax close to the usual ambiguous mathematical n...
Claudio Sacerdoti Coen, Stefano Zacchiroli
123
Voted
ENTCS
2011
131views more  ENTCS 2011»
14 years 9 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
Ed Blakey