Sciweavers

3913 search results - page 129 / 783
» complexity 2006
Sort
View
DAM
2007
77views more  DAM 2007»
13 years 10 months ago
Decompositions of graphs of functions and fast iterations of lookup tables
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
Boaz Tsaban
NAR
2000
101views more  NAR 2000»
13 years 10 months ago
FIMM, a database of functional molecular immunology
FIMM database (http://sdmc.krdl.org.sg:8080/fimm ) contains data relevant to functional molecular immunology, focusing on cellular immunology. It contains fully referenced data on...
Christian Schönbach, Judice L. Y. Koh, Xin Sh...
TPHOL
2006
IEEE
14 years 4 months ago
ACL2
This case study shows how ACL2 can be used to reason about the real and complex numbers, using non-standard analysis. It describes some modifications to ACL2 that include the irr...
Ruben Gamboa
ICISC
2007
96views Cryptology» more  ICISC 2007»
13 years 11 months ago
Colliding Message Pair for 53-Step HAS-160
We present a collision attack on the hash function HAS-160 reduced to 53-steps. The attack has a complexity of about 235 hash computations. The attack is based on the work of Cho e...
Florian Mendel, Vincent Rijmen
NECO
2002
117views more  NECO 2002»
13 years 10 months ago
Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...
James M. Coughlan, Alan L. Yuille