2194 search results - page 280 / 439 » Improving HLRTA*( k ) |
136
click to vote
CF
2007
ACM
15 years 5 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
STOC
2010
ACM
15 years 5 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
121
click to vote
EDBT
2009
ACM
15 years 5 months ago
2009
ACM
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
130
click to vote
FOCS
2009
IEEE
15 years 5 months 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...
101
click to vote
ASIACRYPT
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. It has been recently acknowledged [4, 6, 9] that the use of double bases representations of scalars n, that is an expression of the form n = e,s,t(-1)e As Bt can speed up...