550 search results - page 97 / 110 » pairing 2009 |
STOC
2009
ACM
14 years 10 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
ESORICS
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
CHI
2009
ACM
14 years 10 months ago
2009
ACM
Large general-purposed community question-answering sites are becoming popular as a new venue for generating knowledge and helping users in their information needs. In this paper ...
CHI
2009
ACM
14 years 10 months ago
2009
ACM
Although existing work has explored both information extraction and community content creation, most research has focused on them in isolation. In contrast, we see the greatest le...