Sciweavers

5973 search results - page 430 / 1195
» Fundamental forms of information
Sort
View
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 9 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
NIPS
1997
15 years 9 months ago
Minimax and Hamiltonian Dynamics of Excitatory-Inhibitory Networks
A Lyapunov function for excitatory-inhibitory networks is constructed. The construction assumes symmetric interactions within excitatory and inhibitory populations of neurons, and...
H. Sebastian Seung, Tom J. Richardson, J. C. Lagar...
AAAI
1994
15 years 9 months ago
Incremental Recompilation of Knowledge
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...
Goran Gogic, Christos H. Papadimitriou, Martha Sid...
CRYPTO
2010
Springer
171views Cryptology» more  CRYPTO 2010»
15 years 8 months ago
Credential Authenticated Identification and Key Exchange
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...
Jan Camenisch, Nathalie Casati, Thomas Groß,...
HPDC
2010
IEEE
15 years 8 months ago
MPIPairwiseStatSig: parallel pairwise statistical significance estimation of local sequence alignment
Sequence comparison is considered as a cornerstone application in bioinformatics, which forms the basis of many other applications. In particular, pairwise sequence alignment is a...
Ankit Agrawal, Sanchit Misra, Daniel Honbo, Alok N...