Sciweavers

1041 search results - page 99 / 209
» Randomizing Reductions of Search Problems
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 8 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
CTRSA
2005
Springer
72views Cryptology» more  CTRSA 2005»
14 years 1 months ago
Proofs for Two-Server Password Authentication
Traditional password-based authentication and key-exchange protocols suffer from the simple fact that a single server stores the sensitive user password. In practice, when such a ...
Michael Szydlo, Burton S. Kaliski Jr.
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
13 years 11 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
WWW
2008
ACM
14 years 8 months ago
Tagpedia: a Semantic Reference to Describe and Search for Web Resources
Nowadays the Web represents a growing collection of an enormous amount of contents where the need for better ways to find and organize the available data is becoming a fundamental...
Francesco Ronzano, Andrea Marchetti, Maurizio Tesc...
ICC
2007
IEEE
165views Communications» more  ICC 2007»
14 years 2 months ago
Oblivious Keyword Search Protocols in the Public Database Model
— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...
Huafei Zhu, Feng Bao