680 search results - page 58 / 136 » Optimal spot-checking to minimize the computation time in vo... |
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
CLUSTER
2000
IEEE
14 years 9 months ago
2000
IEEE
Clusters of workstations and networked parallel computing systems are emerging as promising computational platforms for HPC applications. The processors in such systems are typica...
EMSOFT
2007
Springer
15 years 4 months ago
2007
Springer
Software components are modular and can enable post-deployment update, but their high overhead in runtime and memory is prohibitive for many embedded systems. This paper proposes ...
ICPR
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper, the implication of the relations of information in the case of multispectral images is analyzed. Higher-order mutual information can adopt positive or negative valu...
GI
2007
Springer
15 years 4 months ago
2007
Springer
: In addition to the growing complexity of software systems, test effort takes increasing amounts of time and correspondingly more money. Testing costs may be reduced without compr...