Sciweavers

1945 search results - page 214 / 389
» Speeding up Serpent
Sort
View
NIXDORF
1992
116views Hardware» more  NIXDORF 1992»
15 years 10 months ago
Programmable Active Memories: A Performance Assessment
We present some quantitative performance measurements for the computing power of Programmable Active Memories (PAM), as introduced by [2]. Based on Field Programmable Gate Array (...
Patrice Bertin, Didier Roncin, Jean Vuillemin
DICTA
2003
15 years 7 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
SDM
2004
SIAM
214views Data Mining» more  SDM 2004»
15 years 7 months ago
Making Time-Series Classification More Accurate Using Learned Constraints
It has long been known that Dynamic Time Warping (DTW) is superior to Euclidean distance for classification and clustering of time series. However, until lately, most research has...
Chotirat (Ann) Ratanamahatana, Eamonn J. Keogh
AAAI
1998
15 years 7 months ago
Learning Investment Functions for Controlling the Utility of Control Knowledge
The utility problem occurs when the cost of the acquired knowledge outweighs its bene ts. When the learner acquires control knowledge for speeding up a problem solver, the bene t ...
Oleg Ledeniov, Shaul Markovitch
IJCAI
1989
15 years 7 months ago
Program Derivation Using Analogy
We present a methodology for using analogy to derive programs based on a derivational transformation method. The derived programs are deductively closed under the rules in the kno...
Mehdi T. Harandi, Sanjay Bhansali