Sciweavers

463 search results - page 86 / 93
» A General Framework for Graph Sparsification
Sort
View
SPAA
2010
ACM
13 years 7 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
PEPM
2010
ACM
14 years 4 months ago
Context-sensitive analysis of obfuscated x86 executables
A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipul...
Arun Lakhotia, Davidson R. Boccardo, Anshuman Sing...
CVPR
2010
IEEE
13 years 7 months ago
Image atlas construction via intrinsic averaging on the manifold of images
In this paper, we propose a novel algorithm for computing an atlas from a collection of images. In the literature, atlases have almost always been computed as some types of means ...
Yuchen Xie, Jeffrey Ho, Baba C. Vemuri
KDD
2007
ACM
201views Data Mining» more  KDD 2007»
14 years 8 months ago
Structural and temporal analysis of the blogosphere through community factorization
The blogosphere has unique structural and temporal properties since blogs are typically used as communication media among human individuals. In this paper, we propose a novel tech...
Yun Chi, Shenghuo Zhu, Xiaodan Song, Jun'ichi Tate...
SOSP
2009
ACM
14 years 4 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...