Sciweavers

313 search results - page 6 / 63
» Solving Structured Polynomial Systems and Applications to Cr...
Sort
View
SIAMMAX
2011
79views more  SIAMMAX 2011»
13 years 5 months ago
Solving Rational Eigenvalue Problems via Linearization
Rational eigenvalue problems (REPs) are an emerging class of nonlinear eigenvalue problems that arise from a variety of physical applications. In this paper, we propose a lineariz...
Yangfeng Su, Zhaojun Bai
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
14 years 3 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
ICAIL
2009
ACM
14 years 5 months ago
How much logical structure is helpful in content-based argumentation software for legal case solving?
Current argumentation support software often employs graphical representations of logical relationships. Little is known about the extent to which logical structuring helps to inc...
Stijn Colen, Fokie Cnossen, Bart Verheij
ASIACRYPT
2006
Springer
14 years 2 months ago
The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
Pierrick Gaudry, T. Houtmann, D. Kohel, Christophe...
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 9 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...