Sciweavers

12052 search results - page 218 / 2411
» computing 2010
Sort
View
117
Voted
JSC
2010
99views more  JSC 2010»
15 years 1 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray
121
Voted
TIT
2010
107views Education» more  TIT 2010»
14 years 9 months ago
Optimal Error Correction for Computationally Bounded Noise
For adversarial but computationally bounded models of error, we construct appealingly simple and efficient cryptographic encoding and unique decoding schemes whose error-correctio...
Silvio Micali, Chris Peikert, Madhu Sudan, David A...
77
Voted
SAC
2010
ACM
15 years 9 months ago
e-mail authorship verification for forensic investigation
Farkhund Iqbal, Liaquat A. Khan, Benjamin C. M. Fu...
ICDCN
2010
Springer
15 years 9 months ago
On Composability of Reliable Unicast and Broadcast
Anuj Gupta, Sandeep Hans, Kannan Srinathan, C. Pan...
101
Voted
HPDC
2010
IEEE
15 years 2 months ago
Morco: middleware framework for long-running multi-component applications on batch grids
Sundari M. Sivagama, Sathish S. Vadhiyar, Ravi S. ...