Sciweavers

461 search results - page 47 / 93
» An Algorithm for Bi-Decomposition of Logic Functions
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 1 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
IVC
2008
94views more  IVC 2008»
14 years 9 months ago
Enhanced tracking and recognition of moving objects by reasoning about spatio-temporal continuity
A framework for the logical and statistical analysis and annotation of dynamic scenes containing occlusion and other uncertainties is presented. This framework consists of three e...
Brandon Bennett, Derek R. Magee, Anthony G. Cohn, ...
LICS
2010
IEEE
14 years 8 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...
EUSFLAT
2009
312views Fuzzy Logic» more  EUSFLAT 2009»
14 years 7 months ago
Forecasting Exchange Rates: A Neuro-Fuzzy Approach
This paper presents an adaptive neuro-fuzzy inference system (ANFIS) for USD/JPY exchange rates forecasting. Previous work often used time series techniques and neural networks (NN...
Meysam Alizadeh, Roy Rada, Akram Khaleghei Ghoshe ...
87
Voted
AAAI
2012
13 years 1 days ago
Learning Games from Videos Guided by Descriptive Complexity
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speciï...
Lukasz Kaiser