Sciweavers

148 search results - page 18 / 30
» Linear Time Algorithm for the Longest Common Repeat Problem
Sort
View
JPDC
2006
85views more  JPDC 2006»
13 years 7 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
COCOON
2009
Springer
14 years 2 months ago
Coordinate Assignment for Cyclic Level Graphs
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
14 years 2 months ago
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
Michael B. Monagan, Roman Pearce
FTCS
1997
57views more  FTCS 1997»
13 years 9 months ago
Predicting Physical Processes in the Presence of Faulty Sensor Readings
A common problem in the operation of mission critical control systems is that of determining the future value of a physical quantity based upon past measurements of it or of relat...
Matthew Clegg, Keith Marzullo
CORR
2010
Springer
73views Education» more  CORR 2010»
13 years 8 months ago
On Touching Triangle Graphs
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov