Sciweavers

350 search results - page 64 / 70
» Complexity of Planning with Partial Observability
Sort
View
CTRSA
2008
Springer
150views Cryptology» more  CTRSA 2008»
13 years 9 months ago
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...
Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunke...
MOBICOM
2010
ACM
13 years 8 months ago
Privacy vulnerability of published anonymous mobility traces
Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Althou...
Chris Y. T. Ma, David K. Y. Yau, Nung Kwan Yip, Na...
PR
2006
78views more  PR 2006»
13 years 7 months ago
Similarity-based analysis for large networks of ultra-low resolution sensors
By analyzing the similarities between bit streams coming from a network of motion detectors, we can recover the network geometry and discover structure in the human behavior being...
Christopher Richard Wren, David C. Minnen, Sriniva...

Publication
1500views
15 years 8 months ago
Robust Centerline Extraction Framework Using Level Sets
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected aut...
M. Sabry Hassouna, Aly A. Farag

Presentation
3660views
15 years 8 months ago
Robust Centerline Extraction Framework Using Level Sets
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected auto...
M. Sabry Hassouna