450 search results - page 41 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
ENC
2004
IEEE
15 years 3 months ago
2004
IEEE
This paper deals with the problem of controlling highly dynamic mechatronic systems. Such systems may work in several different operation modes, or even underlie continuous mode c...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
122
click to vote
SGAI
2010
Springer
14 years 6 months ago
2010
Springer
: In the present paper we address the problem of computing the Minimal Additional Sensor Sets (MASS) that guarantee a desired level of diagnostic discrimination for a system. Recen...
101
click to vote
TCS
2010
14 years 10 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
105
click to vote
SIROCCO
1998
15 years 1 months ago
1998
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...