Sciweavers

6409 search results - page 477 / 1282
» A Computational Algorithm for Origami Design
Sort
View
ACISP
2007
Springer
15 years 11 months ago
A New Strategy for Finding a Differential Path of SHA-1
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
Jun Yajima, Yu Sasaki, Yusuke Naito, Terutoshi Iwa...
PODC
2010
ACM
15 years 10 months ago
Group mutual exclusion in O(log n) RMR
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
Vibhor Bhatt, Chien-Chung Huang
AIIDE
2009
15 years 8 months ago
Examining Extended Dynamic Scripting in a Tactical Game Framework
Dynamic scripting is a reinforcement learning algorithm designed specifically to learn appropriate tactics for an agent in a modern computer game, such as Neverwinter Nights. This...
Jeremy Ludwig, Arthur Farley
TISSEC
2008
202views more  TISSEC 2008»
15 years 6 months ago
A Framework for Identifying Compromised Nodes in Wireless Sensor Networks
compromised sensor nodes. The framework provides an appropriate abstraction of applicationspecific detection mechanisms and models the unique properties of sensor networks. Based o...
Qing Zhang, Ting Yu, Peng Ning
ECCV
2000
Springer
15 years 11 months ago
How Does CONDENSATION Behave with a Finite Number of Samples?
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...
Oliver D. King, David A. Forsyth