Sciweavers

329 search results - page 25 / 66
» Elliptic Control by Penalty Techniques with Control Reductio...
Sort
View
ALT
2009
Springer
14 years 4 months ago
Complexity versus Agreement for Many Views
Abstract. The paper considers the problem of semi-supervised multiview classification, where each view corresponds to a Reproducing Kernel Hilbert Space. An algorithm based on co-...
Odalric-Ambrym Maillard, Nicolas Vayatis
CDC
2009
IEEE
14 years 8 days ago
Schur-based decomposition for reachability analysis of linear time-invariant systems
— We present a method for complexity reduction in reachability analysis and controller synthesis via a Schur-based decomposition for LTI systems. The decomposition yields either ...
Shahab Kaynama, Meeko Oishi
IPPS
2009
IEEE
14 years 2 months ago
Taking the heat off transactions: Dynamic selection of pessimistic concurrency control
In this paper we investigate feedback-directed dynamic selection between different implementations of atomic blocks. We initially execute atomic blocks using STM with optimistic c...
Nehir Sönmez, Tim Harris, Adrián Crist...
ICPP
2002
IEEE
14 years 15 days ago
Optimal Code Size Reduction for Software-Pipelined Loops on DSP Applications
Code size expansion of software-pipelined loops is a critical problem for DSP systems with strict code size constraint. Some ad-hoc code size reduction techniques were used to try...
Qingfeng Zhuge, Zili Shao, Edwin Hsing-Mean Sha
PKDD
2001
Springer
104views Data Mining» more  PKDD 2001»
13 years 12 months ago
Data Reduction Using Multiple Models Integration
Large amount of available information does not necessarily imply that induction algorithms must use all this information. Samples often provide the same accuracy with less computat...
Aleksandar Lazarevic, Zoran Obradovic