Sciweavers

2254 search results - page 167 / 451
» Computing the minimal covering set
Sort
View
ICPR
2004
IEEE
16 years 7 months ago
Resampling for Face Detection by Self-Adaptive Genetic Algorithm
Over the past ten years, face detection has been thoroughly studied in computer vision research for its interesting applications. However, all of the state-of-the-art statistical ...
Jie Chen, Wen Gao, Xilin Chen
FOCS
2009
IEEE
16 years 1 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
EUROPAR
2009
Springer
15 years 10 months ago
Optimal and Near-Optimal Energy-Efficient Broadcasting in Wireless Networks
Abstract. In this paper we propose an energy-efficient broadcast algorithm for wireless networks for the case where the transmission powers of the nodes are fixed. Our algorithm is...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...
CORR
2008
Springer
110views Education» more  CORR 2008»
15 years 6 months ago
Trimmed Moebius Inversion and Graphs of Bounded Degree
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
BMVC
2010
15 years 4 months ago
FAST: Fast Adaptive Silhouette Area based Template Matching
Template matching is a well-proven approach in the area of articulated object tracking. Matching accuracy and computation time of template matching are essential and yet often con...
Daniel Mohr, Gabriel Zachmann