Sciweavers

1461 search results - page 161 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
FSE
2010
Springer
140views Cryptology» more  FSE 2010»
15 years 11 months ago
Cryptanalysis of ESSENCE
ESSENCE is a hash function submitted to the NIST Hash Competition that stands out as a hardware-friendly and highly parallelizable design. Previous analysis showed some non-randomn...
María Naya-Plasencia, Andrea Röck, Jea...
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 11 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
15 years 10 months ago
Efficient Memory Bound Puzzles Using Pattern Databases
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
Sujata Doshi, Fabian Monrose, Aviel D. Rubin
DAS
2006
Springer
15 years 10 months ago
Combining Multiple Classifiers for Faster Optical Character Recognition
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...
Kumar Chellapilla, Michael Shilman, Patrice Simard
DAWAK
2006
Springer
15 years 10 months ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...