4212 search results - page 648 / 843 » On Compressible Pairings and Their Computation |
158
click to vote
RTA
2005
Springer
16 years 2 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 ...
163
Voted
WADS
2005
Springer
16 years 2 days ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
140
click to vote
WG
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
179
click to vote
PLDI
2004
ACM
16 years 1 days ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
169
click to vote
EGH
2004
Springer
15 years 12 months ago
2004
Springer
The shadow volume algorithm is a popular technique for real-time shadow generation using graphics hardware. Its major disadvantage is that it is inherently fillrate-limited, as t...