Sciweavers

1399 search results - page 25 / 280
» New Algorithms for k-Center and Extensions
Sort
View
SAC
2005
ACM
14 years 2 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
CIS
2006
Springer
14 years 1 months ago
A New Parallel Multiplier for Type II Optimal Normal Basis
In hardware implementation for the finite field, the use of normal basis has several advantages, especially the optimal normal basis is the most efficient to hardware implementati...
Chang Han Kim, Yongtae Kim, Sung Yeon Ji, IlWhan P...
FGR
2006
IEEE
180views Biometrics» more  FGR 2006»
14 years 3 months ago
A New Look at Filtering Techniques for Illumination Invariance in Automatic Face Recognition
Illumination invariance remains the most researched, yet the most challenging aspect of automatic face recognition. In this paper we propose a novel, general recognition framework...
Ognjen Arandjelovic, Roberto Cipolla
RTAS
1995
IEEE
14 years 25 days ago
A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks
The rate monotonic scheduling algorithm is a commonly used task scheduling algorithm for periodic realtime task systems. This paper discusses feasibility decision for a given real...
Yoshifumi Manabe, Shigemi Aoyagi
EMMCVPR
2009
Springer
14 years 3 months ago
Image Registration under Varying Illumination: Hyper-Demons Algorithm
Abstract. The goal of this paper is to present a novel recipe for deformable image registration under varying illumination, as a natural extension of the demons algorithm. This gen...
Mehran Ebrahimi, Anne L. Martel