320 search results - page 26 / 64 » A New Compression Method with Fast Searching on Large Databa... |
DATE
2002
IEEE
14 years 1 months ago
2002
IEEE
We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time...
BMCBI
2006
13 years 8 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...
VECPAR
2004
Springer
14 years 1 months ago
2004
Springer
Peer-to-peer (P2P) computing offers new opportunities for building highly distributed data systems. Unlike client-server computing, P2P can operate without central coordination and...
KDD
1998
ACM
14 years 21 days ago
1998
ACM
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Recent years have witnessed a dramatic increase in the quantity of image data collected, due to advances in fields such as medical imaging, reconnaissance, surveillance, astronomy...