1039 search results - page 81 / 208 » Kernels and Regularization on Graphs |
GD
2003
Springer
15 years 5 months ago
2003
Springer
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
112
click to vote
COMSWARE
2008
IEEE
15 years 7 months ago
2008
IEEE
— We design a framework that implements security at the TCP layer to meet the necessity for a practical and truly end-to-end security solution. We call our framework TCPsec. TCPs...
86
Voted
GD
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the...
AAAI
1996
15 years 2 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
111
click to vote
IEEECIT
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract—In this paper, we propose efficient routing algorithms for collective communication in a newly proposed, versatile network, called a recursive dual-net (RDN). The RDN c...