513 search results - page 84 / 103 » Efficient search for association rules |
INFORMATICALT
2006
14 years 9 months ago
2006
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
CADE
2004
Springer
15 years 10 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
ESWS
2008
Springer
14 years 11 months ago
2008
Springer
We present SHIRI-Annot an automatic ontology-driven and unsupervised approach for the semantic annotation of documents which contain well structured parts and not well structured o...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
101
click to vote
TC
2008
14 years 9 months ago
2008
One of the most critical resource management issues in the use of ternary content addressable memory (TCAM) for packet classification/filtering is how to effectively support filte...