400 search results - page 46 / 80 » Lower Bounds Using Kolmogorov Complexity |
CRYPTO
2011
Springer
12 years 8 months ago
2011
Springer
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...
APAL
2008
13 years 9 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
—Comprehensive performance analysis of the unordered V-BLAST algorithm with various power allocation strategies is presented, which makes use of analytical tools and resorts to M...
ICIP
2001
IEEE
14 years 10 months ago
2001
IEEE
The type of representation used in describing shape can have a significant impact on the effectiveness of a recognition strategy. Shape has been represented by its bounding curve ...