1538 search results - page 33 / 308 » Spectral Techniques in Graph Algorithms |
104
click to vote
ISCAS
2003
IEEE
15 years 6 months ago
2003
IEEE
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...
177
click to vote
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
101
click to vote
WONS
2005
IEEE
15 years 6 months ago
2005
IEEE
At present, no standard frequency allocation mechanism exists for Wireless LAN access points. In this article, we introduce a number of techniques based on graph colouring algorit...
145
click to vote
GC
2008
Springer
15 years 1 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
ICCD
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper, a new FIR digital filter synthesis algorithm is proposed to consider multiple adder graphs for a coefficient. The proposed algorithm selects an adder graph that c...