Sciweavers

80 search results - page 7 / 16
» Data reduction and exact algorithms for clique cover
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Dimensionality reduction and generalization
In this paper we investigate the regularization property of Kernel Principal Component Analysis (KPCA), by studying its application as a preprocessing step to supervised learning ...
Sofia Mosci, Lorenzo Rosasco, Alessandro Verri
ISLPED
2005
ACM
96views Hardware» more  ISLPED 2005»
14 years 29 days ago
Region-level approximate computation reuse for power reduction in multimedia applications
ABSTRACT Motivated by data value locality and quality tolerance present in multimedia applications, we propose a new micro-architecture, Region-level Approximate Computation Buffer...
Xueqi Cheng, Michael S. Hsiao
TC
2011
13 years 2 months ago
Energy Reduction in Consolidated Servers through Memory-Aware Virtual Machine Scheduling
—Increasing energy consumption in server consolidation environments leads to high maintenance costs for data centers. Main memory, no less than processor, is a major energy consu...
Jae-Wan Jang, Myeongjae Jeon, Hyo-Sil Kim, Heeseun...
RECOMB
2004
Springer
14 years 7 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
SODA
2012
ACM
253views Algorithms» more  SODA 2012»
11 years 9 months ago
Kernelization of packing problems
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
Holger Dell, Dániel Marx