Sciweavers

400 search results - page 52 / 80
» An Algorithm for the Reduction of Linear DAE
Sort
View
AUSAI
2001
Springer
15 years 8 months ago
Wrapping Boosters against Noise
Abstract. Wrappers have recently been used to obtain parameter optimizations for learning algorithms. In this paper we investigate the use of a wrapper for estimating the correct n...
Bernhard Pfahringer, Geoffrey Holmes, Gabi Schmidb...
127
Voted
DAGSTUHL
2004
15 years 4 months ago
On the Complexity of Parabolic Initial Value Problems with Variable Drift
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
Knut Petras, Klaus Ritter
COCOON
2010
Springer
15 years 2 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen
121
Voted
ICIP
2009
IEEE
15 years 1 months ago
Gamut fitting for image composition applications
Existing digital image composition algorithms neglect the out-of-gamut problem, i.e. some pixel values in a composited image exceed the displayable or printable range. In this pap...
Wenxian Yang, Jianmin Zheng, Jianfei Cai
156
Voted
TKDE
2008
195views more  TKDE 2008»
15 years 3 months ago
Learning a Maximum Margin Subspace for Image Retrieval
One of the fundamental problems in Content-Based Image Retrieval (CBIR) has been the gap between low-level visual features and high-level semantic concepts. To narrow down this gap...
Xiaofei He, Deng Cai, Jiawei Han