Sciweavers

9997 search results - page 1825 / 2000
» The case for crowd computing
Sort
View
JAL
2006
101views more  JAL 2006»
15 years 5 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
JUCS
2008
156views more  JUCS 2008»
15 years 5 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng
JUCS
2008
120views more  JUCS 2008»
15 years 5 months ago
Guaranteeing Seamless Mobility with User Redials and Automatic Handover Retrials
: In communication systems that guarantee seamless mobility of users across service areas, repeated attempts occur as a result of user behavior but also as automatic retries of blo...
José Manuel Giménez-Guzmán, M...
JOC
2006
69views more  JOC 2006»
15 years 5 months ago
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
Jonathan Katz, Moti Yung
196
Voted
PERCOM
2008
ACM
15 years 5 months ago
P2P multicast for pervasive ad hoc networks
Integrating p2p services in multi-hop ad hoc networks is today a hot topic. General multi-hop , and pervasive systems in particular, can greatly benefit from high-level middleware...
Franca Delmastro, Andrea Passarella, Marco Conti
« Prev « First page 1825 / 2000 Last » Next »