1538 search results - page 108 / 308 » Spectral Techniques in Graph Algorithms |
134
click to vote
VTC
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—This paper studies the performance of orthogonal frequency division multiple access – time division duplex (OFDMA-TDD) cellular networks when jointly applying dynamic ...
105
click to vote
FLAIRS
2000
15 years 2 months ago
2000
Hierarchical conceptual clustering has been proven to be a useful data mining technique. Graph-based representation of structural information has been shown to be successful in kn...
104
click to vote
SODA
2000
ACM
15 years 2 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
111
click to vote
AAAI
1996
15 years 2 months ago
1996
The state space of most adversary games is a directed graph. However, due to the success of simple recursive algorithms based on Alpha-Beta, theoreticians and practitioners have c...
108
click to vote
APVIS
2006
15 years 2 months ago
2006
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networ...