3218 search results - page 243 / 644 » Timed Extensions for SDL |
158
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
167
click to vote
ISPD
2000
ACM
15 years 11 months ago
2000
ACM
The standard cell placement problem has been extensively studied in the past twenty years. Many approaches were proposed and proven e ective in practice. However, successful place...
194
click to vote
SIGIR
1999
ACM
15 years 10 months ago
1999
ACM
The fast growth of multimedia information in image and video databases has triggered research on efficient retrieval methods. This paper deals with structural queries, a type of c...
153
click to vote
SWAT
1998
Springer
15 years 10 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
169
click to vote
SWAT
1992
Springer
15 years 10 months ago
1992
Springer
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...