Sciweavers

580 search results - page 55 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
131
Voted
IJCNN
2008
IEEE
15 years 9 months ago
Biologically realizable reward-modulated hebbian training for spiking neural networks
— Spiking neural networks have been shown capable of simulating sigmoidal artificial neural networks providing promising evidence that they too are universal function approximat...
Silvia Ferrari, Bhavesh Mehta, Gianluca Di Muro, A...
DIS
2004
Springer
15 years 8 months ago
Tiling Databases
Abstract. In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consis...
Floris Geerts, Bart Goethals, Taneli Mielikäi...
114
Voted
SAT
2005
Springer
145views Hardware» more  SAT 2005»
15 years 8 months ago
A New Approach to Model Counting
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
Wei Wei, Bart Selman
98
Voted
IJCAI
1989
15 years 3 months ago
Maximum Entropy in Nilsson's Probabilistic Logic
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
Thomas B. Kane
ACCV
2007
Springer
15 years 8 months ago
Task Scheduling in Large Camera Networks
Camera networks are increasingly being deployed for security. In most of these camera networks, video sequences are captured, transmitted and archived continuously from all cameras...
Ser-Nam Lim, Larry S. Davis, Anurag Mittal