32545 search results - page 579 / 6509 » Data Structures and Algorithms |
227
click to vote
CIKM
2011
Springer
14 years 7 months ago
2011
Springer
This paper presents Yagada, an algorithm to search labelled graphs for anomalies using both structural data and numeric attributes. Yagada is explained using several security-rela...
197
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
181
click to vote
CCCG
2010
15 years 8 months ago
2010
In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinat...
209
Voted
AAAI
2010
15 years 8 months ago
2010
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...
181
click to vote
CALC
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...