Sciweavers

492 search results - page 59 / 99
» Perfect Matching Preservers
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
15 years 6 months ago
Anonymizing bipartite graph data using safe groupings
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a larg...
Graham Cormode, Divesh Srivastava, Ting Yu, Qing Z...
IEAAIE
2010
Springer
15 years 4 months ago
Strategies for Incorporating Knowledge Defects and Path Length in Trust Aggregation
The ability for a user to accurately estimate the amount of trust to be placed in a peer user is gaining more and more attention in social network applications. Trust aggregation p...
Nele Verbiest, Chris Cornelis, Patricia Victor, En...
ASIACRYPT
2009
Springer
16 years 1 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
STOC
2004
ACM
152views Algorithms» more  STOC 2004»
16 years 7 months ago
Exponential separation of quantum and classical one-way communication complexity
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
DAGSTUHL
2007
15 years 8 months ago
Signalling Preferences in Interviewing Markets
The process of match formation in matching markets can be divided into three parts: information sharing, investments in information acquisition, and the formation of matches based...
Robin S. Lee, Michael A. Schwarz