Sciweavers

1101 search results - page 41 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
ICASSP
2009
IEEE
15 years 8 months ago
Microarray classification using block diagonal linear discriminant analysis with embedded feature selection
In this paper, block diagonal linear discriminant analysis (BDLDA) is improved and applied to gene expression data. BDLDA is a classification tool with embedded feature selection...
Lingyan Sheng, Roger Pique-Regi, Shahab Asgharzade...
CATS
2006
15 years 3 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
15 years 7 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava
ICC
2007
IEEE
15 years 8 months ago
Optical WDM Network Planning Using Heterogeneous Multi-granularity OXCs
Multigranular optical WDM network aims to reduce network cost by grouping multiple wavelengths and then switching those wavelengths together at waveband or fiber levels. To configu...
Hong-Hsu Yen, Frank Yeong-Sung Lin, Steven S. W. L...
BROADNETS
2006
IEEE
15 years 8 months ago
Traffic Grooming Techniques in Optical Networks
: With the increase of the number of wavelengths per fiber waveband switching has been proposed to decrease the number of switching ports in optical nodes. Another concept that of ...
Yabin Ye, Hagen Woesner, Imrich Chlamtac