Sciweavers

10493 search results - page 215 / 2099
» Dynamic Word Problems
Sort
View
SIAMIS
2011
13 years 3 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...
UAI
2008
13 years 9 months ago
Identifying Dynamic Sequential Plans
We address the problem of identifying dynamic sequential plans in the framework of causal Bayesian networks, and show that the problem is reduced to identifying causal effects, fo...
Jin Tian
IVC
2008
148views more  IVC 2008»
13 years 8 months ago
Cognitive vision: The case for embodied perception
This paper considers arguments for the necessity of embodiment in cognitive vision systems. We begin by delineating the scope of cognitive vision, and follow this by a survey of t...
David Vernon
IWOCA
2009
Springer
117views Algorithms» more  IWOCA 2009»
14 years 25 days ago
On the Maximal Number of Cubic Subwords in a String
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum ...
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter,...
SACRYPT
2009
Springer
141views Cryptology» more  SACRYPT 2009»
14 years 2 months ago
Cryptanalysis of Dynamic SHA(2)
In this paper, we analyze the hash functions Dynamic SHA and Dynamic SHA2, which have been selected as first round candidates in the NIST hash function competition. These hash fun...
Jean-Philippe Aumasson, Orr Dunkelman, Sebastiaan ...