9532 search results - page 97 / 1907 » Logic, Graphs, and Algorithms |
118
click to vote
COMSUR
2011
13 years 11 months ago
2011
Abstract—We provide an overview of link scheduling algorithms in Spatial Time Division Access (STDMA) wireless mesh networks. These algorithms can be classified into three categ...
ICPP
1995
IEEE
15 years 2 months ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...
103
click to vote
KDD
2005
ACM
15 years 11 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
EPIA
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
ISCAS
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we present a new logic synthesis method for PLA with 2-input logic elements. A PLA with 2-input logic elements can achieve low-power dissipation and high-speed oper...