Sciweavers

4343 search results - page 705 / 869
» Improving Visual Matching
Sort
View
115
Voted
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
13 years 10 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...
DAC
2011
ACM
13 years 10 months ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting
ICDCS
2011
IEEE
13 years 9 months ago
Provisioning a Multi-tiered Data Staging Area for Extreme-Scale Machines
—Massively parallel scientific applications, running on extreme-scale supercomputers, produce hundreds of terabytes of data per run, driving the need for storage solutions to im...
Ramya Prabhakar, Sudharshan S. Vazhkudai, Youngjae...
LPAR
2012
Springer
13 years 5 months ago
E-Matching with Free Variables
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
Philipp Rümmer
STOC
2012
ACM
193views Algorithms» more  STOC 2012»
13 years 17 days ago
A new point of NP-hardness for unique games
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
Ryan O'Donnell, John Wright