868 search results - page 21 / 174 » A general compression algorithm that supports fast searching |
ICDAR
2003
IEEE
14 years 28 days ago
2003
IEEE
Classifier subset selection (CSS) from a large ensemble is an effective way to design multiple classifier systems (MCSs). Given a validation dataset and a selection criterion, the...
BMCBI
2008
13 years 7 months ago
2008
Background: Protein structure analysis and comparison are major challenges in structural bioinformatics. Despite the existence of many tools and algorithms, very few of them have ...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
UIST
2010
ACM
13 years 5 months ago
2010
ACM
Modern mobile phones can store a large amount of data, such as contacts, applications and music. However, it is difficult to access specific data items via existing mobile user in...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...