Sciweavers

1829 search results - page 359 / 366
» aims 2008
Sort
View
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
13 years 11 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 11 months ago
Simultaneous Unsupervised Learning of Disparate Clusterings
Most clustering algorithms produce a single clustering for a given data set even when the data can be clustered naturally in multiple ways. In this paper, we address the difficult...
Prateek Jain, Raghu Meka, Inderjit S. Dhillon
EMSOFT
2008
Springer
13 years 11 months ago
On the interplay of dynamic voltage scaling and dynamic power management in real-time embedded applications
Dynamic Voltage Scaling (DVS) and Dynamic Power Management (DPM) are two popular techniques commonly employed to save energy in real-time embedded systems. DVS policies aim at red...
Vinay Devadas, Hakan Aydin
FAST
2008
13 years 11 months ago
Enhancing Storage System Availability on Multi-Core Architectures with Recovery-Conscious Scheduling
In this paper we develop a recovery conscious framework for multi-core architectures and a suite of techniques for improving the resiliency and recovery efficiency of highly conc...
Sangeetha Seshadri, Lawrence Chiu, Cornel Constant...
FOCS
2008
IEEE
13 years 11 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...