144 search results - page 19 / 29 » Algorithms for the Hypergraph and the Minor Crossing Number ... |
ESA
2001
Springer
14 years 1 months ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
JMLR
2012
11 years 11 months ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
ISPD
2005
ACM
14 years 2 months ago
2005
ACM
Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant p...
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...