3420 search results - page 552 / 684 » Proximity Search in Databases |
185
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...
210
click to vote
SIGCOMM
2012
ACM
13 years 8 months ago
2012
ACM
Distributed key-value stores are now a standard component of high-performance web services and cloud computing applications. While key-value stores offer significant performance...
202
click to vote
SIGMOD
2012
ACM
13 years 8 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
230
click to vote
SIGIR
2012
ACM
13 years 8 months ago
2012
ACM
Similarity search is a key challenge for multimedia retrieval applications where data are usually represented in high-dimensional space. Among various algorithms proposed for simi...
164
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...