1998 search results - page 162 / 400 » Basic Association Rules |
154
click to vote
ASP
2005
Springer
15 years 9 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
143
Voted
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
133
Voted
LOPSTR
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
148
Voted
PVLDB
2010
15 years 2 months ago
2010
Our analysis of many real-world event based applications has revealed that existing Complex Event Processing technology (CEP), while effective for efficient pattern matching on e...
227
click to vote
CVPR
2010
IEEE
16 years 9 days ago
2010
IEEE
We propose a novel tracking algorithm that can work robustly in a challenging scenario such that several kinds of appearance and motion changes of an object occur at the same time....