Sciweavers

4498 search results - page 146 / 900
» How to Invent Functions
Sort
View
ISW
2009
Springer
15 years 9 months ago
On Free-Start Collisions and Collisions for TIB3
In this paper, we present free-start collisions for the TIB3 hash function with a complexity of about 232 compression function evaluations. By using message modification technique...
Florian Mendel, Martin Schläffer
87
Voted
ACSD
2005
IEEE
71views Hardware» more  ACSD 2005»
15 years 8 months ago
Maximal Causality Analysis
Perfectly synchronous systems immediately react to the inputs of their environment, which may lead to so-called causality cycles between actions and their trigger conditions. Algo...
Klaus Schneider, Jens Brandt, Tobias Schüle, ...
116
Voted
IDEAS
2005
IEEE
106views Database» more  IDEAS 2005»
15 years 8 months ago
Using the Lock Manager to Choose Timestamps
Our goal is to support transaction-time functionality that enables the coexistence of ordinary, non-temporal tables with transaction-time tables. In such a system, each transactio...
David B. Lomet, Richard T. Snodgrass, Christian S....
126
Voted
DAGM
2003
Springer
15 years 7 months ago
A Generative Model Based Approach to Motion Segmentation
We address the question of how to choose between different likelihood functions for motion estimation. To this end, we formulate motion estimation as a problem of Bayesian inferen...
Daniel Cremers, Alan L. Yuille
CDC
2009
IEEE
172views Control Systems» more  CDC 2009»
15 years 7 months ago
Approximate dynamic programming using fluid and diffusion approximations with applications to power management
—TD learning and its refinements are powerful tools for approximating the solution to dynamic programming problems. However, the techniques provide the approximate solution only...
Wei Chen, Dayu Huang, Ankur A. Kulkarni, Jayakrish...