Sciweavers

57 search results - page 5 / 12
» On the Connection Between Signcryption and One-Pass Key Esta...
Sort
View
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 7 months ago
Reductions Between Expansion Problems
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
Prasad Raghavendra, David Steurer, Madhur Tulsiani
ICDE
2003
IEEE
134views Database» more  ICDE 2003»
14 years 8 months ago
Propagating XML Constraints to Relations
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
Susan B. Davidson, Wenfei Fan, Carmem S. Hara, Jin...
AAAI
2000
13 years 8 months ago
A Game-Theoretic Approach to Constraint Satisfaction
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
Phokion G. Kolaitis, Moshe Y. Vardi
ACL
2012
11 years 9 months ago
Automatic Event Extraction with Structured Preference Modeling
This paper presents a novel sequence labeling model based on the latent-variable semiMarkov conditional random fields for jointly extracting argument roles of events from texts. ...
Wei Lu, Dan Roth
FC
2004
Springer
94views Cryptology» more  FC 2004»
14 years 24 days ago
The Ephemeral Pairing Problem
Abstract In wireless ad-hoc broadcast networks the pairing problem consists of establishing a (long-term) connection between two specific physical nodes in the network that do not...
Jaap-Henk Hoepman