Sciweavers

340 search results - page 15 / 68
» ets 2009
Sort
View
ISPEC
2011
Springer
14 years 2 months ago
Meet-in-the-Middle Attack on 8 Rounds of the AES Block Cipher under 192 Key Bits
The AES block cipher has a 128-bit block length and a user key of 128, 192 or 256 bits, released by NIST for data encryption in the USA; it became an ISO international standard in ...
Yongzhuang Wei, Jiqiang Lu, Yupu Hu
ICIP
2009
IEEE
16 years 25 days ago
Fractional Laplacian Pyramids
We provide an extension of the L2-spline pyramid (Unser et al., 1993) using polyharmonic splines. We analytically prove that the corresponding error pyramid behaves exactly as a m...
ICML
2009
IEEE
16 years 17 days ago
Surrogate regret bounds for proper losses
We present tight surrogate regret bounds for the class of proper (i.e., Fisher consistent) losses. The bounds generalise the margin-based bounds due to Bartlett et al. (2006). The...
Mark D. Reid, Robert C. Williamson
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
16 years 9 days ago
Complete Fairness in Multi-party Computation without an Honest Majority
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...
S. Dov Gordon, Jonathan Katz
WADS
2009
Springer
256views Algorithms» more  WADS 2009»
15 years 6 months ago
Dynamic Graph Clustering Using Minimum-Cut Trees
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
Robert Görke, Tanja Hartmann, Dorothea Wagner