Sciweavers

313 search results - page 26 / 63
» Complete Local Search with Memory
Sort
View
EOR
2007
90views more  EOR 2007»
13 years 9 months ago
Tabu search and GRASP for the maximum diversity problem
In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environm...
Abraham Duarte, Rafael Martí
ACIVS
2006
Springer
14 years 3 months ago
A Comparison of Nearest Neighbor Search Algorithms for Generic Object Recognition
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in ...
Ferid Bajramovic, Frank Mattern, Nicholas Butko, J...
IAJIT
2010
150views more  IAJIT 2010»
13 years 8 months ago
Optimal DSP Based Integer Motion Estimation Implementation for H.264/AVC Baseline Encoder
: The coding gain of the H.264/AVC video encoder mainly comes from the new incorporated prediction tools. However, their enormous computation and ultrahigh memory bandwidth are the...
Imen Werda, Haithem Chaouch, Amine Samet, Mohamed ...
SSIAI
2000
IEEE
14 years 2 months ago
Hybrid Hidden Markov Model for Face Recognition
In this paper, we introduce a Hybrid Hidden Markov Model (HMM) face recognition system. The proposed system contains a low-complexity 2-D HMM-based face recognition (LC 2D-HMM FR)...
Hisham Othman, Tyseer Aboulnasr
ENTCS
2006
134views more  ENTCS 2006»
13 years 10 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening