403 search results - page 8 / 81 » A search for positive storage functions |
135
click to vote
NAR
2006
15 years 1 months ago
2006
HHsenser is the first server to offer exhaustive intermediate profile searches, which it combines with pairwise comparison of hidden Markov models. Starting from a single protein ...
100
Voted
SIGIR
2005
ACM
15 years 7 months ago
2005
ACM
We study the problem of offering publish/subscribe functionality on top of structured overlay networks using data models and languages from IR. We show how to achieve this by ext...
101
click to vote
MM
2009
ACM
15 years 8 months ago
2009
ACM
This paper proposes a hash function family based on feature vocabularies and investigates the application in building indexes for image search. Each hash function is associated wi...
122
Voted
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....
136
click to vote
BIBE
2010
IEEE
14 years 8 months ago
2010
IEEE
The study of compressed storage schemes for highly repetitive sequence collections has been recently boosted by the availability of cheaper sequencing technologies and the flood of...