746 search results - page 86 / 150 » Fast (Structured) Newton Computations |
IJFCS
2002
13 years 8 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
CLUSTER
2003
IEEE
14 years 2 months ago
2003
IEEE
In this paper, we present a structure for monitoring a large set of computational clusters. We illustrate methods for scaling a monitor network comprised of many clusters while ke...
RT
2005
Springer
14 years 2 months ago
2005
Springer
Fast global illumination computation is a challenge in several fields such as lighting simulation and computergenerated visual effects for movies. To this end, the irradiance cac...
BMCBI
2008
13 years 9 months ago
2008
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
STRINGOLOGY
2008
13 years 10 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...