Sciweavers

1036 search results - page 148 / 208
» Algorithms for Learning Regular Expressions
Sort
View
ECML
2004
Springer
15 years 11 months ago
Conditional Independence Trees
It has been observed that traditional decision trees produce poor probability estimates. In many applications, however, a probability estimation tree (PET) with accurate probabilit...
Harry Zhang, Jiang Su
JIPS
2010
165views more  JIPS 2010»
15 years 29 days ago
IMTAR: Incremental Mining of General Temporal Association Rules
Nowadays due to the rapid advances in the field of information systems, transactional databases are being updated regularly and/or periodically. The knowledge discovered from these...
Anour F. A. Dafa-Alla, Ho-Sun Shon, Khalid E. K. S...
ICASSP
2011
IEEE
14 years 10 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 10 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
ATAL
2010
Springer
15 years 7 months ago
Alternating-time dynamic logic
We propose Alternating-time Dynamic Logic (ADL) as a multi-agent variant of Dynamic Logic in which atomic programs are replaced by coalitions. In ADL, the Dynamic Logic operators ...
Nicolas Troquard, Dirk Walther