Sciweavers

588 search results - page 42 / 118
» Reducibility and Completeness in Private Computations
Sort
View
CASCON
2008
102views Education» more  CASCON 2008»
13 years 11 months ago
Online stroke modeling for handwriting recognition
The process of recognizing individual handwritten characters is one of classifying curves. Typically, handwriting recognition systems-even "online" systems--require enti...
Oleg Golubitsky, Stephen M. Watt
ICWN
2004
13 years 11 months ago
A Distributed Clustering Framework in Mobile Ad Hoc Networks
Abstract-- In this paper, we present a completely distributed algorithm for partitioning a given set of mobile nodes into clusters. The proposed algorithm tries to reduce the amoun...
Mohit Garg, R. K. Shyamasundar
ASIACRYPT
2010
Springer
13 years 8 months ago
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
Jens Groth
ICIP
1994
IEEE
14 years 11 months ago
Document Image Decoding
It has been shown that the computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. In ...
Gary E. Kopec, Philip A. Chou
IEEEPACT
2008
IEEE
14 years 4 months ago
Distributed cooperative caching
This paper presents the Distributed Cooperative Caching, a scalable and energy-efficient scheme to manage chip multiprocessor (CMP) cache resources. The proposed configuration is...
Enric Herrero, José González, Ramon ...