Sciweavers

1084 search results - page 139 / 217
» Optimal worm-scanning method using vulnerable-host distribut...
Sort
View
IPPS
1997
IEEE
14 years 1 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
IMC
2003
ACM
14 years 2 months ago
Virtual landmarks for the internet
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
Liying Tang, Mark Crovella
SIGIR
2010
ACM
13 years 9 months ago
SED: supervised experimental design and its application to text classification
In recent years, active learning methods based on experimental design achieve state-of-the-art performance in text classification applications. Although these methods can exploit ...
Yi Zhen, Dit-Yan Yeung
ICCV
2005
IEEE
14 years 2 months ago
Non-Negative Lighting and Specular Object Recognition
Recognition of specular objects is particularly difficult because their appearance is much more sensitive to lighting changes than that of Lambertian objects. We consider an appr...
Sameer Shirdhonkar, David W. Jacobs
MICCAI
2000
Springer
14 years 19 days ago
Retrospective Correction of MR Intensity Inhomogeneity by Information Minimization
In this paper, the problem of retrospective correction of intensity inhomogeneity in magnetic resonance (MR) images is addressed. A novel model-based correction method is proposed,...
Bostjan Likar, Max A. Viergever, Franjo Pernus