1150 search results - page 78 / 230 » Note from the Editor |
LMCS
2006
13 years 9 months ago
2006
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing tha...
COMCOM
1998
13 years 8 months ago
1998
In this note, we show that a proposed secure broadcasting scheme is insecure. We also present a modified scheme to overcome this weakness. The modified scheme has the extra adva...
KES
2010
Springer
13 years 7 months ago
2010
Springer
— This work presents related areas of research, types of data collections that are visualized, technical aspects of generating visualizations, and evaluation methodologies. Exist...
NAACL
2010
13 years 6 months ago
2010
The Brown and the Berkeley parsers are two state-of-the-art generative parsers. Since both parsers produce n-best lists, it is possible to apply reranking techniques to the output...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
As with any application of machine learning, web search ranking requires labeled data. The labels usually come in the form of relevance assessments made by editors. Click logs can...