Sciweavers

4302 search results - page 790 / 861
» Index Pairs Algorithms
Sort
View
CCS
2008
ACM
13 years 11 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
ICSE
2010
IEEE-ACM
13 years 11 months ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen
FORMATS
2008
Springer
13 years 10 months ago
Timed Parity Games: Complexity and Robustness
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
ALT
2010
Springer
13 years 10 months ago
Contrast Pattern Mining and Its Application for Building Robust Classifiers
: The ability to distinguish, differentiate and contrast between different data sets is a key objective in data mining. Such ability can assist domain experts to understand their d...
Kotagiri Ramamohanarao
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 10 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...