3616 search results - page 487 / 724 » Conditional Memory Ordering |
115
click to vote
SPAA
1998
ACM
15 years 7 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
117
click to vote
3DIM
1997
IEEE
15 years 7 months ago
1997
IEEE
Video-rate registered range and intensity data are at reach of current sensor technology. This wealth of data can be pro tably exploited in order to estimate rigid motion paramete...
130
click to vote
LCTRTS
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. Previously published methods for estimation of the worstcase execution time on contemporary processors with complex pipelines and multi-level memory hierarchies result in...
117
click to vote
OOPSLA
1998
Springer
15 years 7 months ago
1998
Springer
With the spread of the Internet the computing model on server systems is undergoing several important changes. Recent research ideas concerning dynamic operating system extensibil...
126
click to vote
VLDB
1998
ACM
15 years 7 months ago
1998
ACM
The query execution engine in Microsoft SQL Server employs hash-based algorithms for inner and outer joins, semi-joins, set operations (such as intersection), grouping, and duplic...