Sciweavers

962 search results - page 33 / 193
» Efficient Algorithms for Eulerian Extension
Sort
View
ECCV
2008
Springer
15 years 11 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
Neeraj Kumar, Li Zhang, Shree K. Nayar
AE
2009
Springer
14 years 10 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
ICIP
2005
IEEE
15 years 11 months ago
Augmented particle filtering for efficient visual tracking
Visual tracking is one of the key tasks in computer vision. The particle filter algorithm has been extensively used to tackle this problem due to its flexibility. However the conv...
Chunhua Shen, Michael J. Brooks, Anton van den Hen...
IPPS
2010
IEEE
14 years 7 months ago
Hypergraph-based task-bundle scheduling towards efficiency and fairness in heterogeneous distributed systems
This paper investigates scheduling loosely coupled task-bundles in highly heterogeneous distributed systems. Two allocation quality metrics are used in pay-per-service distributed ...
Han Zhao, Xinxin Liu, Xiaolin Li
CSDA
2008
65views more  CSDA 2008»
14 years 9 months ago
Improving updating rules in multiplicative algorithms for computing D-optimal designs
In this paper we discuss a class of multiplicative algorithms for computing D-optimal designs for regression models on a finite design space. We prove a monotonicity result for a ...
Holger Dette, Andrey Pepelyshev, Anatoly A. Zhiglj...