2107 search results - page 386 / 422 » Computing Small Search Numbers in Linear Time |
FOCS
2009
IEEE
14 years 23 days ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
MIR
2010
ACM
13 years 10 months ago
2010
ACM
This paper presents a classification-driven biomedical image retrieval system to bride the semantic gap by transforming image features to their global categories at different gran...
CIE
2010
Springer
14 years 24 days ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Record label companies would like to identify potential artists as early as possible in their careers, before other companies approach the artists with competing contracts. The va...
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
—This paper reports on experience gained and lessons learned from an intensive investigation of model-driven engineering methodology and technology for application to high-integr...