2561 search results - page 127 / 513 » Enhanced Quicksort Algorithm |
DATE
1999
IEEE
15 years 2 months ago
1999
IEEE
In many algorithms, particularly those in the DSP domain, certain forms of symmetry can be observed. To efficiently implement such algorithms, it is often possible to exploit thes...
DAC
1996
ACM
15 years 2 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
ACL
2003
14 years 11 months ago
2003
This paper proposes the use of uncertainty reduction in machine learning methods such as co-training and bilingual bootstrapping, which are referred to, in a general term, as ‘c...
EUSFLAT
2003
14 years 11 months ago
2003
The paper presents a specialised Partial Least Squares (PLS) algorithm for on-line calibration monitoring. At first, the basic scheme and philosophy of PEANO (Process Evaluation a...
AICOM
2004
14 years 10 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...