Sciweavers

14704 search results - page 384 / 2941
» computer 2007
Sort
View
234
Voted
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
16 years 1 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
182
Voted
ICCV
2007
IEEE
16 years 9 months ago
Exploiting Occluding Contours for Real-Time 3D Tracking: A Unified Approach
Gang Li, Yanghai Tsin, Yakup Genc