Sciweavers

104 search results - page 9 / 21
» A Survey of Fast Exponentiation Methods
Sort
View
SACRYPT
2007
Springer
151views Cryptology» more  SACRYPT 2007»
14 years 2 months ago
Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, wh...
Christophe De Cannière, Florian Mendel, Chr...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 12 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
AAAI
2011
12 years 7 months ago
Logistic Methods for Resource Selection Functions and Presence-Only Species Distribution Models
In order to better protect and conserve biodiversity, ecologists use machine learning and statistics to understand how species respond to their environment and to predict how they...
Steven Phillips, Jane Elith
FORMATS
2008
Springer
13 years 9 months ago
Some Recent Results in Metric Temporal Logic
Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model c...
Joël Ouaknine, James Worrell
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
13 years 5 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen