1403 search results - page 152 / 281 » Set cover algorithms for very large datasets |
177
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
126
click to vote
PAKDD
2009
ACM
16 years 27 days ago
2009
ACM
Atypical behaviours are the basis of a valuable knowledge in domains related to security (e.g. fraud detection for credit card [1], cyber security [4] or safety of critical systems...
181
Voted
APPROX
2009
Springer
16 years 22 days ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
153
click to vote
GCB
2000
Springer
15 years 9 months ago
2000
Springer
We describe an algorithm for the automatic discovery of recurring patterns in protein structures. The patterns consist of individual residues having a defined order along the prote...
138
click to vote
COMPSAC
2006
IEEE
16 years 5 days ago
2006
IEEE
This work proposes a new methodology for intelligent classification and retrieval of software components based on user–defined requirements. The classification scheme utilizes a...