1538 search results - page 33 / 308 » Spectral Techniques in Graph Algorithms |
ISCAS
2003
IEEE
14 years 3 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...
ICML
2003
IEEE
14 years 11 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...
WONS
2005
IEEE
14 years 3 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...
GC
2008
Springer
13 years 10 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
14 years 7 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...