Sciweavers

84 search results - page 7 / 17
» Directed Transitive Signature Scheme
Sort
View
AAECC
2006
Springer
102views Algorithms» more  AAECC 2006»
15 years 5 months ago
An effective proof of the well-foundedness of the multiset path ordering
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
Solange Coupet-Grimal, William Delobel
ISSTA
2009
ACM
15 years 11 months ago
Identifying bug signatures using discriminative graph mining
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
Hong Cheng, David Lo, Yang Zhou, Xiaoyin Wang, Xif...
ICALP
2005
Springer
15 years 10 months ago
Append-Only Signatures
We present a new primitive—Append-only Signatures (AOS)—with the property that any party given an AOS signature Sig[M1] on message M1 can compute Sig[M1 M2] for any message M2...
Eike Kiltz, Anton Mityagin, Saurabh Panjwani, Bara...
CP
2004
Springer
15 years 10 months ago
Quality of LP-Based Approximations for Highly Combinatorial Problems
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
Lucian Leahu, Carla P. Gomes
WWW
2008
ACM
16 years 5 months ago
Setting Access Permission through Transitive Relationship in Web-based Social Networks
The rising popularity of Web 2.0, such as blogs, forums, online calendars/diaries, etc., makes users more interested in keeping their data on the Web. Sharing of such data could m...
Dan Hong, Vincent Y. Shen