1688 search results - page 163 / 338 » The Complexity of Rationalizing Matchings |
126
click to vote
MSR
2010
ACM
15 years 11 months ago
2010
ACM
—This paper presents an approach to automatically distinguish the copied clone from the original in a pair of clones. It matches the line-by-line version information of a clone t...
151
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
123
click to vote
RT
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. This paper proposes a simple augmentation to texture mapping hardware which produces the correct depth buffer content and hence correct visibility when replacing complex ...
163
click to vote
IJCGA
2006
15 years 6 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
153
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...