Sciweavers

2784 search results - page 418 / 557
» Relation Extraction with Relation Topics
Sort
View
JCB
2002
70views more  JCB 2002»
13 years 10 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...
SIGIR
2002
ACM
13 years 9 months ago
Analysis of papers from twenty-five years of SIGIR conferences: what have we been doing for the last quarter of a century?
mes, abstracts and year of publication of all 853 papers published.1 We then applied Porter stemming and stopword removal to this text, represented terms from the elds with twice t...
Alan F. Smeaton, Gary Keogh, Cathal Gurrin, Kieran...
ISI
2008
Springer
13 years 8 months ago
Intelligent pattern recognition and biometrics
This talk deals with advanced concepts of Artificial Intelligence (AI) and Pattern Recognition (PR), and their applications to solving real life problems including biometrics appl...
P. Wang
IJLIT
2010
67views more  IJLIT 2010»
13 years 8 months ago
Interoperability-Centric Problems: New Challenges and Legal Solutions
Whereas abandonment of detailed regulation is widely asserted to be the true way along with the fluctuations of the business models and emergence of IP-based services, there are s...
Turgut Ayhan Beydogan
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 8 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg