Sciweavers

5316 search results - page 357 / 1064
» Which Search Problems Are Random
Sort
View
WWW
2005
ACM
16 years 8 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
IMA
2007
Springer
97views Cryptology» more  IMA 2007»
16 years 1 months ago
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear appro...
Juan M. Estévez-Tapiador, John A. Clark, Ju...
ICGA
1997
122views Optimization» more  ICGA 1997»
15 years 8 months ago
A Comparison of Global and Local Search Methods in Drug Docking
Molecular docking software makes computational predictions of the interaction of molecules. This can be useful, for example, in evaluating the binding of candidate drug molecules ...
Christopher D. Rosin, R. Scott Halliday, William E...
CVPR
2009
IEEE
17 years 2 months ago
Boosted Multi-Task Learning for Face Verification With Applications to Web Image and Video Search
Face verification has many potential applications including filtering and ranking image/video search results on celebrities. Since these images/videos are taken under uncontrolle...
Xiaogang Wang (MIT), Cha Zhang (Microsoft Research...
CVPR
2004
IEEE
16 years 9 months ago
The SPS Algorithm: Patching Figural Continuity and Transparency by Split-Patch Search
This paper describes a novel algorithm for the efficient synthesis of high-quality virtual views from only two input images. The emphasis is on the recovery of continuity of objec...
Antonio Criminisi, Andrew Blake