903 search results - page 98 / 181 » Non-well-founded trees in categories |
196
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
178
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
In this paper, we describe the development of a fielded application for detecting malicious executables in the wild. We gathered 1971 benign and 1651 malicious executables and enc...
159
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
Discovering coherent gene expression patterns in time-series gene expression data is an important task in bioinformatics research and biomedical applications. In this paper, we pr...
205
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
154
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
Active XML is a high-level specification language tailored to dataintensive, distributed, dynamic Web services. Active XML is based on XML documents with embedded function calls. ...