5100 search results - page 583 / 1020 » The Linear Complexity of a Graph |
169
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...
168
click to vote
TJS
2008
15 years 6 months ago
2008
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
201
click to vote
ACTA
2000
15 years 6 months ago
2000
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
172
click to vote
IJCGA
2002
15 years 6 months ago
2002
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...
144
click to vote
PRL
2002
15 years 6 months ago
2002
Pattern detection problems require a separation between two classes, Target and Clutter, where the probability of the former is substantially smaller compared to that of the latte...