849 search results - page 85 / 170 » Completely Non-malleable Schemes |
139
click to vote
COORDINATION
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. The deployment of Share Data Spaces in open, possibly hostile, environments arises the need of protecting the confidentiality of the data space content. Existing approach...
108
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
WINE
2005
Springer
15 years 6 months ago
2005
Springer
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
108
Voted
ICIP
2004
IEEE
16 years 2 months ago
2004
IEEE
In this paper we propose a fast motion estimation technique that works in the wavelet domain. The computational cost of the algorithm turns out to be proportional to the linear si...
209
click to vote
ICDE
2006
IEEE
16 years 2 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...