219 search results - page 16 / 44 » Time and Space Lower Bounds for Implementations Using k-CAS |
BIBE
2005
IEEE
14 years 2 months ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
TPDS
2010
13 years 7 months ago
2010
Abstract—In the past few years, P2P file distribution applications (e.g., BitTorrent) are becoming so popular that they are the dominating source of Internet traffic. This crea...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
SSDBM
2000
IEEE
14 years 5 days ago
2000
IEEE
Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries ...