Sciweavers

16666 search results - page 2947 / 3334
» Descriptive and Computational Complexity
Sort
View
JBI
2008
15 years 6 months ago
The Field Representation Language
The complexity of quantitative biomedical models, and the rate at which they are published, is increasing to a point where managing the information has become all but impossible w...
Guy Tsafnat
IJSN
2006
140views more  IJSN 2006»
15 years 6 months ago
Load-balanced key establishment methodologies in wireless sensor networks
: 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...
Ortal Arazi, Hairong Qi
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 6 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
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...
Martin J. Wainwright
CORR
2007
Springer
72views Education» more  CORR 2007»
15 years 6 months ago
WACA: A Hierarchical Weighted Clustering Algorithm optimized for Mobile Hybrid Networks
—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...
Matthias R. Brust, Adrian Andronache, Steffen Roth...
JCS
2008
109views more  JCS 2008»
15 years 6 months ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
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...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...
« Prev « First page 2947 / 3334 Last » Next »