14699 search results - page 2541 / 2940 » Complexity and Cognitive Computing |
214
click to vote
IJSN
2006
15 years 7 months ago
2006
: Wireless Sensor Networks (WSN) pose a need for dynamically establishing a secret key joint to a group of nodes. Elliptic Curve Cryptography (ECC) has emerged as a suitable public...
202
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
160
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. In a dynamic environment—in terms of node mobility as well as in ter...
215
click to vote
JCS
2008
15 years 7 months ago
2008
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
223
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...