Sciweavers

2440 search results - page 159 / 488
» Data-Intensive Question Answering
Sort
View
DAGSTUHL
2007
13 years 11 months ago
Tightness of the Security Bound of CENC
CENC (Cipher-based ENCryption) is the recently designed encryption mode for blockciphers. It is provably secure with beyond the birthday bound. In this note, we present a simple di...
Tetsu Iwata
LREC
2008
130views Education» more  LREC 2008»
13 years 11 months ago
Annotating Subjective Content in Meetings
This paper presents an annotation scheme for marking subjective content in meetings, specifically the opinions and sentiments that participants express as part of their discussion...
Theresa Wilson
COLING
2000
13 years 11 months ago
Experiments in Automated Lexicon Building for Text Searching
This paper describes experiments in the automatic construction of lexicons that would be useful in searching large document collections for text fragments that address a specific ...
Barry Schiffman, Kathleen McKeown
AML
2007
75views more  AML 2007»
13 years 10 months ago
On the definable ideal generated by the plus cupping c.e. degrees
In this paper we will prove that the plus cupping degrees generate a definable ideal on c.e. degrees different from other ones known so far, thus answer a question asked by A. Li...
Wei Wang, Decheng Ding
DM
2008
110views more  DM 2008»
13 years 10 months ago
Nonrepetitive colorings of graphs of bounded tree-width
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We ans...
André Kündgen, Michael J. Pelsmajer