1986 search results - page 59 / 398 » Path Separability of Graphs |
EJC
2007
13 years 8 months ago
2007
A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . , ek...
ESOP
2006
Springer
14 years 13 days ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
COSIT
2003
Springer
14 years 2 months ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
CCCG
2008
13 years 10 months ago
2008
Given a set of points in a Hilbert space that can be separated from the origin. The slab support vector machine (slab SVM) is an optimization problem that aims at finding a slab (...
IJACTAICIT
2010
13 years 3 months ago
2010
This paper describes an adaptive noise cancellation structure suitable for the separation and equalization of signals that coupled due to the approximate placing of primary and au...