4536 search results - page 660 / 908 » Contention-Sensitive Data Structures and Algorithms |
158
click to vote
RTA
2005
Springer
16 years 3 days ago
2005
Springer
Many applications of congruence closure nowadays require the ability of recovering, among the thousands of input equations, the small subset that caused the equivalence of a given ...
183
click to vote
VISUALIZATION
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper we present an interactive texture-based technique for visualizing three-dimensional vector fields. The goal of the algorithm is to provide a general volume renderin...
150
click to vote
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
219
click to vote
SIGSOFT
1994
ACM
15 years 10 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
173
click to vote
ISAAC
1992
Springer
15 years 10 months ago
1992
Springer
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...