Sciweavers

904 search results - page 164 / 181
» Scheduling task graphs optimally with A
Sort
View
CODES
2001
IEEE
13 years 11 months ago
Hybrid global/local search strategies for dynamic voltage scaling in embedded multiprocessors
In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multipr...
Neal K. Bambha, Shuvra S. Bhattacharyya, Jürg...
CIKM
2009
Springer
14 years 2 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
14 years 1 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
BMCBI
2008
228views more  BMCBI 2008»
13 years 7 months ago
Adaptive diffusion kernel learning from biological networks for protein function prediction
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
Liang Sun, Shuiwang Ji, Jieping Ye
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
11 years 10 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...