Sciweavers

5595 search results - page 373 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
15 years 11 months ago
A clustering- and probability-based approach for time-multiplexed FPGA partitioning
Improving logic density by time-sharing, time-multiplexed FPGAs (TMFPGAs) have become an important research topic for reconfigurable computing. Due to the precedence and capacity ...
Mango Chia-Tso Chao, Guang-Ming Wu, Iris Hui-Ru Ji...
ESA
2008
Springer
111views Algorithms» more  ESA 2008»
15 years 8 months ago
Parallel Imaging Problem
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
Thành Nguyen, Éva Tardos
GECCO
2008
Springer
172views Optimization» more  GECCO 2008»
15 years 7 months ago
Recursive least squares and quadratic prediction in continuous multistep problems
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...
Daniele Loiacono, Pier Luca Lanzi
JIIS
2006
103views more  JIIS 2006»
15 years 6 months ago
Time-focused clustering of trajectories of moving objects
Spatio-temporal, geo-referenced datasets are growing rapidly, and will be more in the near future, due to both technological and social/commercial reasons. From the data mining vie...
Mirco Nanni, Dino Pedreschi
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
16 years 1 days ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...