685 search results - page 71 / 137 » Closure Operators for Order Structures |
126
Voted
ASIAN
2004
Springer
15 years 8 months ago
2004
Springer
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
125
Voted
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
This paper proposes a feature-based method for recovering the relative positions of the viewpoints of a set of panoramic images for which no a priori order information is availabl...
117
Voted
DOCENG
2006
ACM
15 years 8 months ago
2006
ACM
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
109
click to vote
SIGMETRICS
2004
ACM
15 years 8 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
129
click to vote
DAC
1999
ACM
15 years 6 months ago
1999
ACM
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...