2194 search results - page 117 / 439 » Improving HLRTA*( k ) |
134
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
A K∗ -sparse vector x∗ ∈ RN produces measurements via linear dimensionality reduction as u = Φx∗ + n, where Φ ∈ RM×N (M < N), and n ∈ RM consists of independent ...
164
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
—Most existing large-scale networked systems on the Internet such as peer-to-peer systems are vulnerable to Sybil attacks where a single adversary can introduce many bogus identi...
130
click to vote
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
297
click to vote
COCOON
2011
Springer
14 years 1 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
128
click to vote
IACR
2011
14 years 1 months ago
2011
KASUMI is a block cipher which consists eight Feistel rounds with a 128-bit key. The confidentiality and integrity of UMTS, GSM and GPRS mobile communications systems depend heavi...