1998 search results - page 74 / 400 » Complexity of the Cover Polynomial |
CAISE
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Enterprise Architecture (EA) models provide information on the fundamental as-is structure of a company or governmental agency and thus serve as an informational basis fo...
DATE
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...
EJC
2008
13 years 10 months ago
2008
1 Rational functions and minimal factorizations of permutations Let f : C C be a rational function of degree n in one complex variable. A critical point of f is a point z C such...
SIAMCOMP
2010
13 years 4 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
EDBT
2004
ACM
14 years 10 months ago
2004
ACM
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...