106 search results - page 10 / 22 » Trees with exponentially growing costs |
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
We propose a new method for the blind separation of multiple binary signals from a single general nonlinear mixture. In addition to the usual independence assumption on the input ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
111
click to vote
PKC
2009
Springer
16 years 8 days ago
2009
Springer
This paper describes new methods in pairing-based signature schemes for identifying the invalid digital signatures in a batch, after batch verification has failed. These methods ef...
119
click to vote
STOC
2004
ACM
16 years 19 hour ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
FCCM
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper presents a method, called multiple constant multiplier trees MCMTs, for producing optimized recon gurable hardware implementations of vector products. An algorithm for ...