Sciweavers

2740 search results - page 312 / 548
» Approximating Component Selection
Sort
View
149
Voted
JMLR
2008
131views more  JMLR 2008»
15 years 4 months ago
On Relevant Dimensions in Kernel Feature Spaces
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...
Mikio L. Braun, Joachim M. Buhmann, Klaus-Robert M...
PUC
2006
89views more  PUC 2006»
15 years 4 months ago
UbiqStack: a taxonomy for a ubiquitous computing software stack
This paper describes a taxonomy for a ubiquitous computing software stack called UbiqStack. Through the lens of the UbiqStack taxonomy we survey a variety of subsystems designed to...
Martin Modahl, Bikash Agarwalla, T. Scott Saponas,...
HEURISTICS
1998
252views more  HEURISTICS 1998»
15 years 3 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
PRL
2008
143views more  PRL 2008»
15 years 3 months ago
An active feedback framework for image retrieval
In recent years, relevance feedback has been studied extensively as a way to improve performance of content-based image retrieval (CBIR). Since users are usually unwilling to prov...
Tao Qin, Xu-Dong Zhang, Tie-Yan Liu, De-Sheng Wang...
SAMOS
2010
Springer
15 years 2 months ago
Identifying communication models in Process Networks derived from Weakly Dynamic Programs
—Process Networks (PNs) is an appealing computation ion helping to specify an application in parallel form and realize it on parallel platforms. The key questions to be answered ...
Dmitry Nadezhkin, Todor Stefanov