1986 search results - page 102 / 398 » Path Separability of Graphs |
DAGSTUHL
2001
13 years 10 months ago
2001
Visualization of an algorithm offers only a rough picture of operations. Explanations are crucial for deeper understanding, because they help the viewer to associate the visualiza...
CPAIOR
2010
Springer
14 years 1 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
CASES
2001
ACM
14 years 16 days ago
2001
ACM
Current development tools for embedded real-time systems do not efficiently support the timing aspect. The most important timing parameter for scheduling and system analysis is th...
MICCAI
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. The support vector domain description is a one-class classification method that estimates the shape and extent of the distribution of a data set. This separates the data ...
ICDM
2006
IEEE
14 years 2 months ago
2006
IEEE
Internet routing dynamics have been extensively studied in the past few years. However, dynamics such as interdomain Border Gateway Protocol (BGP) behavior are still poorly unders...