Sciweavers

8728 search results - page 396 / 1746
» On Reduct Construction Algorithms
Sort
View
APPROX
2007
Springer
102views Algorithms» more  APPROX 2007»
16 years 1 months ago
Hardness of Embedding Metric Spaces of Equal Size
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
Subhash Khot, Rishi Saket
ICMCS
2005
IEEE
90views Multimedia» more  ICMCS 2005»
16 years 13 days ago
Area of surface as a basis for vertex removal based mesh simplification
A new, area-based mesh simplification algorithm is described. The proposed algorithm removes the center vertex of a polygon which consists of n ≥ 3 faces and represents that po...
Insu Park, Shahram Shirani, David W. Capson
ICIP
1995
IEEE
15 years 10 months ago
Novel fast block motion estimation in feature subspace
Motion estimation and compensation are widely used in video coding. This paper presents two fast block matching algorithms for motion estimation. These algorithms use the subspace...
Yiu-Hung Fok, Oscar C. Au, Ross D. Murch
ICASSP
2010
IEEE
15 years 7 months ago
Distance-based discretization of parametric signal manifolds
The characterization of signals and images in manifolds often lead to efficient dimensionality reduction algorithms based on manifold distance computation for analysis or classi...
Elif Vural, Pascal Frossard
EOR
2007
174views more  EOR 2007»
15 years 6 months ago
A Benders approach for the constrained minimum break problem
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
Rasmus V. Rasmussen, Michael A. Trick