1265 search results - page 15 / 253 » Algorithms for Drawing Media |
ICDAR
2003
IEEE
14 years 1 months ago
2003
IEEE
Line detection algorithms constitute the basis for technical document analysis and recognition. The performance of these algorithms decreases as the quality of the documents degra...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
IPPS
1999
IEEE
14 years 22 days ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
GD
2005
Springer
14 years 1 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
IWOCA
2010
Springer
13 years 3 months ago
2010
Springer
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimiza...