Sciweavers

5372 search results - page 94 / 1075
» complexity 2007
Sort
View
AINA
2007
IEEE
14 years 2 months ago
Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values
The multiparty multiplication of two polynomially shared values over Zq with a public prime number q is an important module in distributed computations. The multiplication protoco...
Peter Lory
ICC
2007
IEEE
147views Communications» more  ICC 2007»
14 years 2 months ago
MIMO OFDM Frequency Offset Estimator with Low Computational Complexity
— This paper addresses a low complexity frequency offset estimator for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over freque...
Yanxiang Jiang, Xiaohu You, Xiqi Gao, Hlaing Minn
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca T...
ER
2007
Springer
103views Database» more  ER 2007»
14 years 1 months ago
Ensuring the Semantic Correctness of Complex Regions
Ensuring the semantic and topological correctness of spatial data is an important requirement in geographical information systems and spatial database systems in order to preserve ...
Mark McKenney, Alejandro Pauly, Reasey Praing, Mar...
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
14 years 1 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar