19320 search results - page 39 / 3864 » On the complexity of computing determinants |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Existing syntactic grammars of natural languages, even with a far from complete coverage, are complex objects. Assessments of the quality of parts of such grammars are useful for t...
INFOCOM
1997
IEEE
15 years 1 months ago
1997
IEEE
The non-deterministic behaviors in telecommunication services are well-known as one of the most typical Feature Interactions, and they should be detected and eliminated from the t...
ISAAC
2003
Springer
15 years 2 months ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
83
Voted
CAD
2005
Springer
14 years 9 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
101
click to vote
FECS
2010
14 years 7 months ago
2010
In this paper, we present a method to help teach computer architecture (or computer organization) by developing an in class system where the students, themselves, compile high-leve...