Sciweavers

3019 search results - page 487 / 604
» Approximating the Domatic Number
Sort
View
OOPSLA
2000
Springer
15 years 10 months ago
Scalable propagation-based call graph construction algorithms
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
Frank Tip, Jens Palsberg
ICCV
1995
IEEE
15 years 10 months ago
Algorithms for Implicit Deformable Models
This paper presents a framework for implicit deformable models and a pair of new algorithms for solving the nonlinear partial di erential equations that result from this framework...
Ross T. Whitaker
ICPP
1995
IEEE
15 years 10 months ago
Unicasting in Faulty Hypercubes Using Safety Levels
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...
Jie Wu
RT
1995
Springer
15 years 10 months ago
The Role of Functional Analysis in Global Illumination
Abstract: The problem of global illumination is virtually synonymouswith solving the rendering equation. Although a great deal of research has been directed toward Monte Carlo and ...
James Arvo
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
15 years 10 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner