Sciweavers

2127 search results - page 200 / 426
» Computing large matchings fast
Sort
View
ICPR
2008
IEEE
15 years 11 months ago
Indexing and retrieving cursive documents without recognition
A large amount of handwritten documents exist in image form, as scanned documents. The supporting electronic media allows for better preservation, but to access their content they...
Antonio Clavelli, Luigi P. Cordella, Claudio De St...
WACV
2002
IEEE
15 years 9 months ago
Fingerprint Verification Using Genetic Algorithms
Fingerprint matching is still a challenging problem for reliable person authentication because of the complex distortions involved in two impressions of the same finger. In this p...
Xuejun Tan, Bir Bhanu
ML
2000
ACM
103views Machine Learning» more  ML 2000»
15 years 4 months ago
Phase Transitions in Relational Learning
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
Attilio Giordana, Lorenza Saitta
SC
2009
ACM
15 years 11 months ago
Kestrel: an XMPP-based framework for many task computing applications
This paper presents a new distributed computing framework for Many Task Computing (MTC) applications, based on the Extensible Messaging and Presence Protocol (XMPP). A lightweight...
Lance Stout, Michael A. Murphy, Sebastien Goasguen
IACR
2011
127views more  IACR 2011»
14 years 4 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky