Sciweavers

851 search results - page 122 / 171
» Random constructions and density results
Sort
View
GECCO
2004
Springer
15 years 3 months ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 2 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
DAC
1989
ACM
15 years 2 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
CCS
2010
ACM
14 years 10 months ago
A new framework for efficient password-based authenticated key exchange
Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. The...
Adam Groce, Jonathan Katz
DSS
2006
170views more  DSS 2006»
14 years 10 months ago
Adoption of internet banking: An empirical study in Hong Kong
This study investigates how customers perceive and adopt Internet Banking (IB) in Hong Kong. We developed a theoretical model based on the Technology Acceptance Model (TAM) with a...
T. C. Edwin Cheng, David Y. C. Lam, Andy C. L. Yeu...