Sciweavers

6943 search results - page 978 / 1389
» Representations for evolutionary algorithms
Sort
View
204
Voted
JCP
2007
118views more  JCP 2007»
15 years 6 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci
212
Voted
PRL
2010
188views more  PRL 2010»
15 years 5 months ago
Sparsity preserving discriminant analysis for single training image face recognition
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
Lishan Qiao, Songcan Chen, Xiaoyang Tan
259
Voted
ACSC
2010
IEEE
15 years 1 months ago
Efficient contour line labelling for terrain modelling
Terrains are an essential part of outdoor environments. Terrain models are important for computer games and applications in architecture, urban design and archaeology. A popular a...
Xin Xie, Burkhard Wünsche
218
Voted
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 10 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
203
Voted
RSCTC
2000
Springer
197views Fuzzy Logic» more  RSCTC 2000»
15 years 10 months ago
Rough Set Approach to CBR
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
Jan Wierzbicki