Sciweavers

264 search results - page 29 / 53
» On the possibility of faster SAT algorithms
Sort
View
93
Voted
COLT
2010
Springer
14 years 8 months ago
Open Loop Optimistic Planning
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
Sébastien Bubeck, Rémi Munos
ICASSP
2010
IEEE
14 years 10 months ago
Consensus in correlated random topologies: Weights for finite time horizon
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
Dusan Jakovetic, João Xavier, José M...
116
Voted
FSE
2011
Springer
264views Cryptology» more  FSE 2011»
14 years 1 months ago
An Improved Algebraic Attack on Hamsi-256
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
Itai Dinur, Adi Shamir
EMSOFT
2009
Springer
15 years 2 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
77
Voted
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
14 years 10 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo