Sciweavers

5363 search results - page 79 / 1073
» Building the Cerebellum in a Computer
Sort
View
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
15 years 9 months ago
Less Hashing, Same Performance: Building a Better Bloom Filter
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
Adam Kirsch, Michael Mitzenmacher
AGI
2008
15 years 7 months ago
Vector Symbolic Architectures: A New Building Material for Artificial General Intelligence
We provide an overview of Vector Symbolic Architectures (VSA), a class of structured associative memory models that offers a number of desirable features for artificial general int...
Simon D. Levy, Ross Gayler
CRIWG
2003
15 years 7 months ago
Building Virtual Communities for Information Retrieval
The search for relevant information is often hindered by the initial difficulty in formulating precise requests, and because much knowledge is actually tacit and thus not easily ac...
Daniel Memmi, Olivier Nérot
CN
1999
88views more  CN 1999»
15 years 5 months ago
Building a high-performance, programmable secure coprocessor
Secure coprocessors enable secure distributed applications by providing safe havens where an application program can Z .execute and accumulate state , free of observation and inte...
Sean W. Smith, Steve Weingart
IMCSIT
2010
15 years 3 months ago
Building and Using Existing Hunspell Dictionaries and TeX Hyphenators as Finite-State Automata
Abstract--There are numerous formats for writing spellcheckers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word h...
Tommi Pirinen, Krister Lindén