Sciweavers

1651 search results - page 37 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ACL
2009
13 years 5 months ago
Do Automatic Annotation Techniques Have Any Impact on Supervised Complex Question Answering?
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
Yllias Chali, Sadid A. Hasan, Shafiq R. Joty
SIAMJO
2008
82views more  SIAMJO 2008»
13 years 7 months ago
Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
A first order affine scaling method and two mth order affine scaling methods for solving monotone linear complementarity problems (LCP) are presented. All three methods produce ite...
Florian A. Potra
TCSV
2008
143views more  TCSV 2008»
13 years 7 months ago
High-Speed Action Recognition and Localization in Compressed Domain Videos
We present a compressed domain scheme that is able to recognize and localize actions in real-time1 . The recognition problem is posed as performing an action video query on a test ...
Chuohao Yeo, Parvez Ahammad, Kannan Ramchandran, S...
ICCV
2003
IEEE
14 years 9 months ago
Minimally-Supervised Classification using Multiple Observation Sets
This paper discusses building complex classifiers from a single labeled example and vast number of unlabeled observation sets, each derived from observation of a single process or...
Chris Stauffer
ARTS
1999
Springer
13 years 12 months ago
Specifying Performance Measures for PEPA
Stochastic process algebras such as PEPA provide ample support for the component-based construction of models. Tools compute the numerical solution of these models; however, the st...
Graham Clark, Stephen Gilmore, Jane Hillston