1034 search results - page 17 / 207 » Wide Classes |
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
SIGCSE
2000
ACM
14 years 29 days ago
2000
ACM
In 1999, most computer science students participate in at least one group project in some class prior to graduation. However, assessing individual student contributions to a group...
LREC
2008
13 years 10 months ago
2008
One problem of data-driven answer extraction in open-domain factoid question answering is that the class distribution of labeled training data is fairly imbalanced. This imbalance...
ICTAI
1999
IEEE
14 years 27 days ago
1999
IEEE
Locating useful information effectively from the World Wide Web (WWW) is of wide interest. This paper presents new results on a methodology of using the structures and hyperlinks ...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...