Sciweavers

7 search results - page 1 / 2
» Improved Efficiency for Private Stable Matching
Sort
View
CTRSA
2007
Springer
102views Cryptology» more  CTRSA 2007»
13 years 8 months ago
Improved Efficiency for Private Stable Matching
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
13 years 11 months ago
Efficient Private Record Linkage
— Record linkage is the computation of the associations among records of multiple databases. It arises in contexts like the integration of such databases, online interactions and...
Mohamed Yakout, Mikhail J. Atallah, Ahmed K. Elmag...
FC
2007
Springer
105views Cryptology» more  FC 2007»
13 years 8 months ago
Space-Efficient Private Search with Applications to Rateless Codes
Abstract. Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the s...
George Danezis, Claudia Díaz
CVPR
2010
IEEE
14 years 1 months ago
Linked Edges as Stable Region Boundaries
Many of the recently popular shape based category recognition methods require stable, connected and labeled edges as input. This paper introduces a novel method to find the most st...
Michael Donoser, Hayko Riemenschneider and Horst B...
ICPR
2008
IEEE
14 years 6 months ago
Using web search engines to improve text recognition
In this paper we introduce a framework for automated text recognition from images. We first describe a simple but efficient text detection and recognition method based on analysis...
Horst Bischof, Michael Donoser, Silke Wagner