172 search results - page 31 / 35 » A Forward Analysis for Recurrent Sets |
170
click to vote
POPL
2003
ACM
15 years 10 months ago
2003
ACM
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
101
click to vote
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
ICSNW
2004
Springer
15 years 3 months ago
2004
Springer
Peer-to-Peer systems have proven to be an effective way of sharing data. Modern protocols are able to efficiently route a message to a given peer. However, determining the destin...
BMCBI
2007
14 years 9 months ago
2007
Background: High-throughput experiments, such as with DNA microarrays, typically result in hundreds of genes potentially relevant to the process under study, rendering the interpr...
109
click to vote
SIGIR
2011
ACM
14 years 17 days ago
2011
ACM
We study the problem of automatically assigning appropriate music pieces to a picture or, in general, series of pictures. This task, commonly referred to as soundtrack suggestion,...