Sciweavers

1032 search results - page 35 / 207
» Extended Computation Tree Logic
Sort
View
ICDM
2003
IEEE
160views Data Mining» more  ICDM 2003»
15 years 3 months ago
Indexing and Mining Free Trees
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...
Yun Chi, Yirong Yang, Richard R. Muntz
ENC
2004
IEEE
15 years 1 months ago
Distributed Learning in Intentional BDI Multi-Agent Systems
Despite the relevance of the belief-desire-intention (BDI) model of rational agency, little work has been done to deal with its two main limitations: the lack of learning competen...
Alejandro Guerra-Hernández, Amal El Fallah-...
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
15 years 11 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...
IFSA
2007
Springer
133views Fuzzy Logic» more  IFSA 2007»
15 years 3 months ago
Fuzzy Tree Mining: Go Soft on Your Nodes
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
Federico Del Razo López, Anne Laurent, Pasc...
WOLLIC
2009
Springer
15 years 4 months ago
An Independence Relation for Sets of Secrets
A relation between two secrets, known in the literature as nondeducibility, was originally introduced by Sutherland. We extend it to a relation between sets of secrets that we call...
Sara Miner More, Pavel Naumov