Sciweavers

2740 search results - page 36 / 548
» Approximating Component Selection
Sort
View
TSP
2010
14 years 4 months ago
Independent component analysis by entropy bound minimization
A novel (differential) entropy estimator is introduced where the maximum entropy bound is used to approximate the entropy given the observations, and is computed using a numerical ...
Xi-Lin Li, Tülay Adali
SIGMOD
2004
ACM
161views Database» more  SIGMOD 2004»
15 years 10 months ago
Approximation Techniques for Spatial Data
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high ...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
TNN
2010
176views Management» more  TNN 2010»
14 years 4 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
QOSA
2010
Springer
14 years 7 months ago
A Hybrid Approach for Multi-attribute QoS Optimisation in Component Based Software Systems
Design decisions for complex, component-based systems impact multiple quality of service (QoS) properties. Often, means to improve one quality property deteriorate another one. In ...
Anne Martens, Danilo Ardagna, Heiko Koziolek, Raff...
NIPS
2008
14 years 11 months ago
Supervised Exponential Family Principal Component Analysis via Convex Optimization
Recently, supervised dimensionality reduction has been gaining attention, owing to the realization that data labels are often available and indicate important underlying structure...
Yuhong Guo