Sciweavers

4377 search results - page 525 / 876
» Mass problems and randomness
Sort
View
ROBOCOMM
2007
IEEE
16 years 1 months ago
Achieving connectivity through coalescence in mobile robot networks
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
Sameera Poduri, Gaurav S. Sukhatme
SYNASC
2007
IEEE
142views Algorithms» more  SYNASC 2007»
16 years 1 months ago
An Extension of the RSA Trapdoor in a KEM/DEM Framework
A trapdoor based on an extension of the RSA trapdoor is proposed. The same function as in the RSA cryptosystem is used, i.e. x modn, but there is no restriction for the exponent t...
Bogdan Groza
ACNS
2007
Springer
136views Cryptology» more  ACNS 2007»
16 years 1 months ago
Identity-Based Proxy Re-encryption
In a proxy re-encryption scheme a semi-trusted proxy converts a ciphertext for Alice into a ciphertext for Bob without seeing the underlying plaintext. A number of solutions have ...
Matthew Green, Giuseppe Ateniese
AUSDM
2007
Springer
107views Data Mining» more  AUSDM 2007»
16 years 1 months ago
Preference Networks: Probabilistic Models for Recommendation Systems
Recommender systems are important to help users select relevant and personalised information over massive amounts of data available. We propose an unified framework called Prefer...
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh
AUSDM
2007
Springer
84views Data Mining» more  AUSDM 2007»
16 years 1 months ago
Detecting Anomalous Longitudinal Associations Through Higher Order Mining
The detection of unusual or anomalous data is an important function in automated data analysis or data mining. However, the diversity of anomaly detection algorithms shows that it...
Ping Liang, John F. Roddick