809 search results - page 124 / 162 » Improving the Performance of MPI Applications over Computati... |
117
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
105
click to vote
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
111
Voted
CAV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
182
click to vote
COMPUTE
2011
ACM
14 years 5 months ago
2011
ACM
In this paper, we have made an effort to propose approaches to find similar legal judgements by extending the popular techniques used in information retrieval and search engines...
116
click to vote
MIDDLEWARE
2005
Springer
15 years 7 months ago
2005
Springer
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...