2107 search results - page 161 / 422 » Computing Small Search Numbers in Linear Time |
135
click to vote
CIARP
2009
Springer
15 years 7 months ago
2009
Springer
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...
143
Voted
PSB
2003
15 years 5 months ago
2003
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
144
Voted
DATESO
2007
15 years 5 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
145
Voted
MM
2006
ACM
15 years 9 months ago
2006
ACM
The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this pape...
160
Voted
SIGMETRICS
2011
ACM
14 years 6 months ago
2011
ACM
Cloud computing, social networking and information networks (for search, news feeds, etc) are driving interest in the deployment of large data centers. TCP is the dominant Layer 3...