Sciweavers

3405 search results - page 241 / 681
» Factoring Groups Efficiently
Sort
View
AUTONOMICS
2008
ACM
15 years 8 months ago
Building multicast trees in ad-hoc networks
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
Raphaël Kummer, Peter G. Kropf, Pascal Felber
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 6 months ago
Discovery of Convoys in Trajectory Databases
As mobile devices with positioning capabilities continue to proliferate, data management for so-called trajectory databases that capture the historical movements of populations of...
Hoyoung Jeung, Man Lung Yiu, Xiaofang Zhou, Christ...
NETWORK
2010
148views more  NETWORK 2010»
15 years 1 months ago
DOM: a scalable multicast protocol for next-generation internet
In this article we propose a scalable and efficient destination-oriented multicast protocol for next-generation Internet. With DOM, each packet carries explicit destinations infor...
Xiaohua Tian, Yu Cheng, Xuemin Shen
CVPR
2009
IEEE
17 years 1 months ago
Multiplicative Nonnegative Graph Embedding
In this paper, we study the problem of nonnegative graph embedding, originally investigated in [14] for reaping the benefits from both nonnegative data factorization and the spe...
Changhu Wang (University of Science and Technology...
DCC
2001
IEEE
16 years 6 months ago
How to Choose Secret Parameters for RSA-Type Cryptosystems over Elliptic Curves
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
Marc Joye, Jean-Jacques Quisquater, Tsuyoshi Takag...