2843 search results - page 230 / 569 » On Efficient Spatial Matching |
152
click to vote
SPAA
1995
ACM
15 years 9 months ago
1995
ACM
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
178
click to vote
COMAD
2008
15 years 6 months ago
2008
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...
149
click to vote
CCS
2010
ACM
15 years 5 months ago
2010
ACM
Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. The...
130
click to vote
IEICET
2006
15 years 5 months ago
2006
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...
130
click to vote
TIP
2008
15 years 5 months ago
2008
Abstract--An efficient algorithm is presented for the computation of grayscale morphological operations with arbitrary 2-D flat structuring elements (S.E.). The required computing ...