15 search results - page 2 / 3 » Finding Close T-indistinguishability Operators to a Given Pr... |
MOBIDE
2010
ACM
13 years 7 months ago
2010
ACM
In many scenarios, particularly in military and emergency response operations, mobile nodes that are in close proximity to each other exhibit a high degree of data affinity. For ex...
BIOINFORMATICS
2008
13 years 7 months ago
2008
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
ALGORITHMICA
2005
13 years 7 months ago
2005
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
CMG
2008
13 years 8 months ago
2008
One of the challenges in building analytic performance models such as queuing network models is obtaining service demands for the various workloads and various devices. While some...
TEC
2008
13 years 7 months ago
2008
This paper deals with the optimal computation of finite field exponentiation, which is a well-studied problem with many important applications in the areas of error-correcting code...