Sciweavers

9842 search results - page 1613 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
SC
2009
ACM
16 years 1 months ago
Using dynamic accounts to enable access to advanced resources through science gateways
Science Gateways have emerged as a valuable solution for providing large numbers of users with access to advanced computing resources. Additionally, they can hide many of the comp...
Joseph A. Insley, Ti Leggett, Michael E. Papka
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
16 years 1 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
CEC
2009
IEEE
16 years 1 months ago
The multiobjective evolutionary algorithm based on determined weight and sub-regional search
— By dividing the multiobjective optimization of the decision space into several small regions, this paper proposes multi-objective optimization algorithm based on sub-regional s...
Hai-lin Liu, Xueqiang Li
DATE
2009
IEEE
112views Hardware» more  DATE 2009»
16 years 1 months ago
Package routability- and IR-drop-aware finger/pad assignment in chip-package co-design
—Due to increasing complexity of design interactions between the chip, package and PCB, it is essential to consider them at the same time. Specifically the finger/pad locations...
Chao-Hung Lu, Hung-Ming Chen, Chien-Nan Jimmy Liu,...
184
Voted
ICASSP
2009
IEEE
16 years 1 months ago
Robust-SL0 for stable sparse representation in noisy settings
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
Armin Eftekhari, Massoud Babaie-Zadeh, Christian J...
« Prev « First page 1613 / 1969 Last » Next »