Sciweavers

2520 search results - page 187 / 504
» The complexity of approximating entropy
Sort
View
86
Voted
NIPS
2004
15 years 13 days ago
Face Detection - Efficient and Rank Deficient
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
Wolf Kienzle, Gökhan H. Bakir, Matthias O. Fr...
ACTA
2007
114views more  ACTA 2007»
14 years 11 months ago
Hybridization methods for the analysis of nonlinear systems
Abstract In this article, we describe some recent results on the hybridization methods for the analysis of nonlinear systems. The main idea of our hybridization approach is to appl...
Eugene Asarin, Thao Dang, Antoine Girard
TIP
1998
109views more  TIP 1998»
14 years 10 months ago
Optimum design of chamfer distance transforms
—The distance transform has found many applications in image analysis. Chamfer distance transforms are a class of discrete algorithms that offer a good approximation to the desir...
Muhammad Akmal Butt, Petros Maragos
ICASSP
2011
IEEE
14 years 2 months ago
Design of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity
This paper proposes a class of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity. To improve the analyticity of complex wavelet, a different allpass ...
Xi Zhang
AAAI
2012
13 years 1 months ago
Optimal Proportional Cake Cutting with Connected Pieces
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, En...