1379 search results - page 168 / 276 » The Complexity of the Annihilating Polynomial |
161
click to vote
CPM
2009
Springer
16 years 1 months ago
2009
Springer
Evolution is usually described as a phylogenetic tree, but due to some exchange of genetic material, it can be represented as a phylogenetic network which has an underlying tree st...
147
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
159
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enabl...
164
click to vote
CDC
2008
IEEE
16 years 27 days ago
2008
IEEE
— The problem of sensor activation in a controlled discrete event system is considered. Sensors are assumed to be costly and can be turned on/off during the operation of the syst...
146
click to vote
ICASSP
2008
IEEE
16 years 26 days ago
2008
IEEE
We consider the problem of planar object registration on binary images where the aligning transformation is restricted to the group of affine transformations. Previous approaches...