Sciweavers

3690 search results - page 492 / 738
» Computation with classical sequents
Sort
View
ICMLA
2004
15 years 8 months ago
Emergent representations and reasoning in adaptive agents
Classically, cognition assumes that the underlying mechanisms of thinking are based on symbol manipulation processes. This assumption has several drawbacks, such as the issue of w...
Joost Broekens, Doug DeGroot
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 8 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
IJCAI
2003
15 years 8 months ago
Variable Resolution Particle Filter
Particle filters are used extensively for tracking the state of non-linear dynamic systems. This paper presents a new particle filter that maintains samples in the state space a...
Vandi Verma, Sebastian Thrun, Reid G. Simmons
ICISC
1998
87views Cryptology» more  ICISC 1998»
15 years 8 months ago
Rabin and RSA analogues based on non-maximal imaginary quadratic orders
Abstract. In 14] and 21] there are proposed ElGamal-type cryptosystems based on non-maximal imaginary quadratic orders with fast trapdoor decryption. The trapdoor information is th...
Detlef Hühnlein, Andreas Meyer, Tsuyoshi Taka...
AMW
2009
15 years 7 months ago
Temporal Support in Sequential Pattern Mining
In sequential pattern discovery, the support of a sequence is computed as the number of data-sequences satisfying a pattern with respect to the total number of data-sequences in th...
Leticia I. Gómez, Bart Kuijpers, Alejandro ...