17329 search results - page 128 / 3466 » Improved non-approximability results |
ECIS
2000
13 years 10 months ago
2000
- This paper reports on a consumer-focused research and development project aimed at investigating the online communication requirements of people with disabilities in Australia. R...
TIT
2008
13 years 8 months ago
2008
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
COLING
2002
13 years 8 months ago
2002
We present a supervised learning approach to identification of anaphoric and non-anaphoric noun phrases and show how such information can be incorporated into a coreference resolu...
STOC
2010
ACM
14 years 6 months ago
2010
ACM
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
PRL
2006
13 years 8 months ago
2006
In earlier papers, it was shown that recognizing persons using their brain patterns evoked during visual stimulus is possible. In this paper, several modifications are proposed to...