1552 search results - page 14 / 311 » On the Complexity of Constant Propagation |
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
TIT
1998
14 years 11 months ago
1998
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
104
click to vote
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
CCS
2008
ACM
15 years 1 months ago
2008
ACM
A considerable number of anonymous RFID authentication schemes have been proposed. However, current proposals either do not provide robust security guarantees, or suffer from scal...
122
click to vote
SAJ
2002
14 years 11 months ago
2002
The predictive hierarchical level of detail optimization algorithm of Mason and Blake is experimentally evaluated in the form of a practical application to hierarchical radiosity....