Sciweavers

1217 search results - page 207 / 244
» On compressing frequent patterns
Sort
View
137
Voted
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 9 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
MKM
2005
Springer
15 years 9 months ago
Determining Empirical Characteristics of Mathematical Expression Use
Abstract. Many processes in mathematical computing try to use knowledge of the most desired forms of mathematical expressions. This occurs, for example, in symbolic computation sys...
Clare M. So, Stephen M. Watt
145
Voted
RULEML
2005
Springer
15 years 9 months ago
Design and Implementation of an ECA Rule Markup Language
an Abstract Syntax and Direct-Model Theoretic Semantics for RuleML . 45 Adrian Giurca and Gerd Wagner A Semantic Web Framework for Interleaving Policy Reasoning and External Servic...
Marco Seiriö, Mikael Berndtsson
136
Voted
IMC
2004
ACM
15 years 9 months ago
Debugging DHCP performance
Dynamic Host Configuration Protocol (DHCP) was defined to facilitate automatic configuration of IP addresses and other network parameters to hosts in a network. Efficiency of D...
Vladimir Brik, Jesse Stroik, Suman Banerjee
133
Voted
SAC
2004
ACM
15 years 9 months ago
Statistical properties of transactional databases
Most of the complexity of common data mining tasks is due to the unknown amount of information contained in the data being mined. The more patterns and correlations are contained ...
Paolo Palmerini, Salvatore Orlando, Raffaele Pereg...