Sciweavers

10848 search results - page 139 / 2170
» Programming in Biomolecular Computation
Sort
View
ICALP
2000
Springer
15 years 8 months ago
Computing the Girth of a Planar Graph
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
Hristo Djidjev
CCCG
2008
15 years 5 months ago
Polynomial irreducibility testing through Minkowski summand computation
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
Deepanjan Kesh, Shashank K. Mehta
LFP
1992
78views more  LFP 1992»
15 years 5 months ago
A Syntactic Approach to Fixed Point Computation on Finite Domains
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
Tyng-Ruey Chuang, Benjamin Goldberg
CGF
2005
147views more  CGF 2005»
15 years 4 months ago
GPU Simulation and Rendering of Volumetric Effects for Computer Games and Virtual Environments
As simulation and rendering capabilities continue to increase, volumetric effects like smoke, fire or explosions will be frequently encountered in computer games and virtual envir...
Jens Krüger, Rüdiger Westermann
SIGCSE
2002
ACM
185views Education» more  SIGCSE 2002»
15 years 4 months ago
Computer science accessibility for students with visual disabilities
Students with visual disabilities face unique challenges in learning to be computer scientists. These challenges can be overcome, however, with the use of specialized software too...
Joan M. Francioni, Ann C. Smith