879 search results - page 65 / 176 » Designing Closer to the Edge |
COCOA
2007
Springer
14 years 4 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
ESA
2007
Springer
14 years 4 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
AAAI
2007
14 years 11 days ago
2007
In this paper, we consider the exploration of topological environments by a robot with weak sensory capabilities. We assume only that the robot can recognize when it has reached a...
CATA
2003
13 years 11 months ago
2003
Binary morphological operations are a building block in many computer vision applications. Several iterative morphological operations are commonly performed for image analysis res...
SIROCCO
2001
13 years 11 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...