Sciweavers

38 search results - page 2 / 8
» Generalized Topological Sorting in Linear Time
Sort
View
TAMC
2007
Springer
13 years 11 months ago
Improving the Average Delay of Sorting
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Re...
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
13 years 5 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen
SIGGRAPH
1996
ACM
13 years 9 months ago
Linear-Time Dynamics Using Lagrange Multipliers
Current linear-time simulation methods for articulated figures are based exclusively on reduced-coordinate formulations. This paper describes a general, non-iterative linear-time ...
David Baraff
RT
1999
Springer
13 years 9 months ago
Computing Visibility for Triangulated Panoramas
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
Chi-Wing Fu, Tien-Tsin Wong, Pheng-Ann Heng
ISCC
2006
IEEE
127views Communications» more  ISCC 2006»
13 years 11 months ago
Visualizing and Managing Network Topologies via Rectangular Dualization
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
Massimo Ancona, Walter Cazzola, Sara Drago, Gianlu...