Sciweavers

2577 search results - page 264 / 516
» Multimedia Question Answering
Sort
View
CRYPTO
2005
Springer
103views Cryptology» more  CRYPTO 2005»
16 years 3 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 2 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 2 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
PKC
2005
Springer
125views Cryptology» more  PKC 2005»
16 years 1 days ago
A Generic Scheme Based on Trapdoor One-Way Permutations with Signatures as Short as Possible
We answer the open question of the possibility of building a digital signature scheme with proven security based on the one-wayness of a trapdoor permutation and with signatures as...
Louis Granboulan
TABLEAUX
2005
Springer
16 years 1 days ago
Comparing Instance Generation Methods for Automated Reasoning
Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of thes...
Swen Jacobs, Uwe Waldmann