Sciweavers

2006 search results - page 73 / 402
» Heuristic Security-Testing Methods
Sort
View
101
Voted
MP
2006
123views more  MP 2006»
15 years 16 days ago
New interval methods for constrained global optimization
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
Mihály Csaba Markót, J. Ferná...
178
Voted
CVPR
2012
IEEE
13 years 5 months ago
Stream-based Joint Exploration-Exploitation Active Learning
Learning from streams of evolving and unbounded data is an important problem, for example in visual surveillance or internet scale data. For such large and evolving real-world data...
Chen Change Loy, Timothy M. Hospedales, Tao Xiang,...
86
Voted
ITCC
2000
IEEE
15 years 5 months ago
Segmentation of Brazilian Bank Check Logos without a Priori Knowledge
This paper presents a method to locate and extract Brazilian bank check logos automatically by employing mathematical morphology. The objective is to minimize the number of heuris...
Andreia de Jesus, Jacques Facon
AAAI
2006
15 years 2 months ago
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...
Meinolf Sellmann, Carlos Ansótegui
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
15 years 7 months ago
Improving Collaborative Filtering Recommendations Using External Data
This paper describes an approach for incorporating externally specified aggregate ratings information into certain types of collaborative filtering (CF) methods. For a statistic...
Akhmed Umyarov, Alexander Tuzhilin