1957 search results - page 373 / 392 » Approximate algorithms for neural-Bayesian approaches |
ICGI
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
101
click to vote
INFOCOM
2010
IEEE
14 years 7 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
102
Voted
SDM
2010
SIAM
14 years 8 months ago
2010
SIAM
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
PAMI
2010
14 years 8 months ago
2010
Computer-vision attention processes allocate computational resources to different parts of visual input and can lead to faster object recognition and image analysis. This paper p...