1529 search results - page 81 / 306 » A slant removal algorithm |
ACSC
2005
IEEE
14 years 4 months ago
2005
IEEE
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
SWAT
1994
Springer
14 years 2 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
WSCG
2004
14 years 5 hour ago
2004
In this article we present a visualisation algorithm based on image warping. A source data for the algorithm is a set of images with colour and depth information rendered for the ...
ENDM
2010
13 years 10 months ago
2010
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attack...
EGH
2009
Springer
13 years 8 months ago
2009
Springer
Stream compaction is a common parallel primitive used to remove unwanted elements in sparse data. This allows highly parallel algorithms to maintain performance over several proce...