Sciweavers

3146 search results - page 192 / 630
» Efficient Consequence Finding
Sort
View
174
Voted
IJACT
2008
101views more  IJACT 2008»
15 years 6 months ago
Practical key-recovery attack against APOP, an MD5-based challenge-response authentication
Abstract: Hash functions are used in many cryptographic constructions under various assumptions, and the practical impact of collision attacks is often unclear. In this paper, we s...
Gaëtan Leurent
IPM
2008
102views more  IPM 2008»
15 years 6 months ago
Fast exact maximum likelihood estimation for mixture of language model
Language modeling is an effective and theoretically attractive probabilistic framework for text information retrieval. The basic idea of this approach is to estimate a language mo...
Yi Zhang 0001, Wei Xu
129
Voted
RIA
2006
60views more  RIA 2006»
15 years 6 months ago
GACS : une approche ascendante pour la coordination spatiale
ABSTRACT. The design of spatial coordination mechanisms for dynamical and continuous multiagent setting is a difficult challenge. While the top-down decomposition approach is ineff...
Fabien Flacher, Olivier Sigaud
CG
2002
Springer
15 years 6 months ago
Tackling Post's Correspondence Problem
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
Ling Zhao
DAM
2002
135views more  DAM 2002»
15 years 6 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera