Sciweavers

3690 search results - page 87 / 738
» Computation with classical sequents
Sort
View
ALMOB
2006
80views more  ALMOB 2006»
14 years 10 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
LMCS
2006
79views more  LMCS 2006»
14 years 9 months ago
Computably Based Locally Compact Spaces
tract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same...
Paul Taylor 0002
ICGA
2007
157views Optimization» more  ICGA 2007»
14 years 9 months ago
Computing "Elo Ratings" of Move Patterns in the Game of Go
Abstract. Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This paper presents a new Bayesian technique for supervised learning of su...
Rémi Coulom
NGC
2010
Springer
183views Communications» more  NGC 2010»
14 years 4 months ago
Brain-like Computing Based on Distributed Representations and Neurodynamics
A key to overcoming the limitations of classical artificial intelligence and to deal well with enormous amounts of information might be brain-like computing in which distributed re...
Ken Yamane, Masahiko Morita
ICASSP
2011
IEEE
14 years 1 months ago
A learning-based approach to explosives detection using Multi-Energy X-Ray Computed Tomography
In this paper we consider the task of classifying materials into explosives and non-explosives according to features obtainable from Multi-Energy X-ray Computed Tomography (MECT) ...
Limor Eger, Synho Do, Prakash Ishwar, W. Clem Karl...