Sciweavers

2475 search results - page 258 / 495
» Question Answering in TREC
Sort
View
CIE
2005
Springer
16 years 6 days ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
CIS
2005
Springer
16 years 6 days ago
On Anonymity of Group Signatures
A secure group signature is required to be anonymous, that is, given two group signatures generated by two different members on the same message or two group signatures generated ...
Sujing Zhou, Dongdai Lin
CRYPTO
2005
Springer
103views Cryptology» more  CRYPTO 2005»
16 years 6 days ago
Pebbling and Proofs of Work
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
Cynthia Dwork, Moni Naor, Hoeteck Wee
ICTCS
2005
Springer
16 years 5 days ago
Weighted Coloring: Further Complexity and Approximability Results
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
Bruno Escoffier, Jérôme Monnot, Vange...
IJCNLP
2005
Springer
16 years 5 days ago
Heuristic Methods for Reducing Errors of Geographic Named Entities Learned by Bootstrapping
Abstract. One of issues in the bootstrapping for named entity recognition is how to control annotation errors introduced at every iteration. In this paper, we present several heuri...
Seungwoo Lee, Gary Geunbae Lee