Sciweavers

21 search results - page 2 / 5
» Parameter Reduction in Grammar-Compressed Trees
Sort
View
SIAMJO
2000
101views more  SIAMJO 2000»
13 years 7 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
TVLSI
2002
78views more  TVLSI 2002»
13 years 7 months ago
Managing on-chip inductive effects
With process technology and functional integration advancing steadily, chips are continuing to grow in area while critical dimensions are shrinking. This has led to the emergence o...
Yehia Massoud, Steve S. Majors, Jamil Kawa, Tareq ...
TSP
2008
99views more  TSP 2008»
13 years 7 months ago
Sphere Decoding With a Probabilistic Tree Pruning
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
Byonghyo Shim, Insung Kang
SDM
2008
SIAM
136views Data Mining» more  SDM 2008»
13 years 8 months ago
Exploration and Reduction of the Feature Space by Hierarchical Clustering
In this paper we propose and test the use of hierarchical clustering for feature selection. The clustering method is Ward's with a distance measure based on GoodmanKruskal ta...
Dino Ienco, Rosa Meo
AMAST
2006
Springer
13 years 11 months ago
The Substitution Vanishes
Abstract. Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient progr...
Armin Kühnemann, Andreas Maletti