170 search results - page 9 / 34 » A Bounding Quantifier |
TWC
2010
13 years 2 months ago
2010
Abstract--Frequency hopping (FH) has been the most popularly considered approach for alleviating the effects of jamming attacks. We re-examine, the efficacy of FH based on both exp...
RTA
1998
Springer
13 years 11 months ago
1998
Springer
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...
ICIP
1998
IEEE
14 years 9 months ago
1998
IEEE
Many rendering or image-analysis systems require calculation of versions of an image at lesser resolutions than the original. Because the filtering required to perform such calcul...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
KDD
2004
ACM
14 years 7 months ago
2004
ACM
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...