Sciweavers

358 search results - page 12 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
SIBGRAPI
2006
IEEE
15 years 7 months ago
Improved FingerCode Matching Function
FingerCode is a fingerprint correlation matching scheme that relies on texture information. In this scheme, the oriented components are extracted from a fingerprint image using a ...
Gustavo de Sa, Roberto de Alencar Lotufo
ICAS
2006
IEEE
143views Robotics» more  ICAS 2006»
15 years 8 months ago
Towards Autonomic Distribution of Existing Object Oriented Programs
By harnessing computational power of distributed heterogeneous resources, it is possible to build a large scale integrated system so that a centralized program is partitioned and ...
Debzani Deb, M. Muztaba Fuad, Michael J. Oudshoorn
CSE
2009
IEEE
15 years 5 months ago
Adapting Privacy-Preserving Computation to the Service Provider Model
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
Florian Kerschbaum
ECP
1997
Springer
125views Robotics» more  ECP 1997»
15 years 6 months ago
Possibilistic Planning: Representation and Complexity
A possibilistic approach of planning under uncertainty has been developed recently. It applies to problems in which the initial state is partially known and the actions have graded...
Célia da Costa Pereira, Frédé...
FSTTCS
2009
Springer
15 years 8 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...