Sciweavers

2600 search results - page 115 / 520
» Clustering with or without the Approximation
Sort
View
DAC
2001
ACM
16 years 2 months ago
High-Quality Operation Binding for Clustered VLIW Datapaths
Clustering is an effective method to increase the available parallelism in VLIW datapaths without incurring severe penalties associated with large number of register file ports. E...
Viktor S. Lapinskii, Margarida F. Jacome, Gustavo ...
98
Voted
ICPR
2008
IEEE
15 years 8 months ago
Beyond partitions: Allowing overlapping groups in pairwise clustering
The field of pairwise clustering is currently dominated by the idea of dividing a set of objects into disjoints classes, thereby giving rise to (hard) partitions of the input dat...
Andrea Torsello, Samuel Rota Bulò, Marcello...
IV
2005
IEEE
136views Visualization» more  IV 2005»
15 years 7 months ago
Improved Visual Clustering of Large Multi-dimensional Data Sets
Lowering computational cost of data analysis and visualization techniques is an essential step towards including the user in the visualization. In this paper we present an improve...
Eduardo Tejada, Rosane Minghim
GECCO
2004
Springer
143views Optimization» more  GECCO 2004»
15 years 7 months ago
Efficient Clustering-Based Genetic Algorithms in Chemical Kinetic Modelling
Two efficient clustering-based genetic algorithms are developed for the optimisation of reaction rate parameters in chemical kinetic modelling. The genetic algorithms employed are ...
Lionel Elliott, Derek B. Ingham, Adrian G. Kyne, N...
IRAL
2003
ACM
15 years 6 months ago
Improving document clustering by utilizing meta-data
In this paper, we examine how to improve the precision and recall of document clustering by utilizing meta-data. We use meta-data through NewsML tags to assist clustering and show...
Kam-Fai Wong, Nam-Kiu Chan, Kam-Lai Wong