1538 search results - page 120 / 308 » Spectral Techniques in Graph Algorithms |
150
click to vote
ISPD
2012
ACM
13 years 9 months ago
2012
ACM
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
112
click to vote
VTC
2006
IEEE
15 years 7 months ago
2006
IEEE
Abstract— In this paper different scheduling algorithms applied to cellular CDMA (code division multiple access) systems with different duplexing modes are studied. In particular...
108
click to vote
TCS
2008
15 years 1 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
95
Voted
BMCBI
2010
15 years 1 months ago
2010
Background: Probing the complex fusion of genetic and environmental interactions, metabolic profiling (or metabolomics/metabonomics), the study of small molecules involved in meta...
102
click to vote
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...