1420 search results - page 49 / 284 » Multi-point Constructive Search |
105
click to vote
CONIELECOMP
2005
IEEE
15 years 7 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
152
click to vote
TIP
2002
15 years 1 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
100
click to vote
ACISP
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
161
click to vote
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
We demonstrate a novel query interface that enables users to construct a rich search query without any prior knowledge of the underlying schema or data. The interface, which is in...
102
click to vote
IJCAI
2003
15 years 3 months ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...