Sciweavers

57 search results - page 10 / 12
» Why is ATPG Easy
Sort
View
CIKM
2009
Springer
15 years 9 months ago
Improving binary classification on text problems using differential word features
We describe an efficient technique to weigh word-based features in binary classification tasks and show that it significantly improves classification accuracy on a range of proble...
Justin Martineau, Tim Finin, Anupam Joshi, Shamit ...
NIPS
1997
15 years 7 months ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis
COLING
1996
15 years 7 months ago
Computation of Relative Social Status on the Basis of Honorification in Korean
This paper presents a way to compute relative social status of the individuals involved in Korean dialogue. Every Korean sentence indicates whether honorification occurs in it. Th...
Done-Young Lee
148
Voted
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 5 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
IJHCI
2008
92views more  IJHCI 2008»
15 years 5 months ago
Coupling the Users: The Benefits of Paired User Testing for iDTV
Interactive digital television (iDTV) is a social medium and must therefore be tested in a context as close to real life as possible. This explains why we saw the potential and im...
Tara Shrimpton-Smith, Bieke Zaman, David Geerts