Sciweavers

779 search results - page 112 / 156
» A graph polynomial for independent sets of bipartite graphs
Sort
View
CLUSTER
2005
IEEE
15 years 3 months ago
Static scheduling of dependent parallel tasks on heterogeneous clusters
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
Jorge G. Barbosa, C. N. Morais, R. Nobrega, A. P. ...
CORR
2010
Springer
182views Education» more  CORR 2010»
14 years 10 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Multicriteria Global Minimum Cuts
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
Amitai Armon, Uri Zwick
AI
2006
Springer
14 years 9 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
WISTP
2010
Springer
15 years 4 months ago
A Probabilistic Diffusion Scheme for Anomaly Detection on Smartphones
Widespread use and general purpose computing capabilities of next generation smartphones make them the next big targets of malicious software (malware) and security attacks. Given ...
Tansu Alpcan, Christian Bauckhage, Aubrey-Derrick ...